1

Topic: Delphi and Monte Carlo Tree Search

I write the chess program. I use a minimax and an alpha-betoj. There it is more and more less clear, it is necessary to cause recursively function of search a signed minus (Negamax). But that is not the question.
Esteemed about Monte Carlo Tree Search and it decided to try to be played with it. Monte Carlo Tree Search it is rough speaking, when we come into the most perspective nodes is more often and we prolong them. But (unlike a minimax) it is necessary to store in Monte-Carlo in storage all tree to do constant Update estimations of nodes and higher nodes.
From here a question:
How it is better to organize the data? Can eat implementations on Delphi the similar?
Thanks in advance.

2

Re: Delphi and Monte Carlo Tree Search

. wrote:

As it is better to organize the data?

"And if it is necessary lines, and go to hell." ()
The tree is better for organizing in the form of a tree. In what a problem?

3

Re: Delphi and Monte Carlo Tree Search

wrote:

it is passed...
Certainly, is. And if is not present - these implementations very simply to implement. smile
There are known books in  environment:
Niklas Virt "ALGORITHMS + DATA STRUCTURES = PROGRAMS".
Dzhulian Baknell "Fundamental algorithms and data structures in Delphi".
Are read easily and with pleasure.
~~~~~~~~~~~~~~~
.

The ready code as I understood is required