--
Don SAID :
--
David Fotland suggested another rule, tell me what you think.
His rule is to stop the game at or beyond move N*N*2 where N is the
board size and score the board no matter what. But in the play-outs he
first plays 1 move before making
I've always had this idea that the best way to build a book might also
be the best way to build a game playing program. For instance we have
done these big studies to determine based on games of Leela and others
what the best main line of play is.Computer Chess programs analyze
huge
On Sun, 2008-10-12 at 11:35 +0200, Denis fidaali wrote:
Hi. I recall somehow that don ran some experiments with min-max(alpha-beta)
algorithms a while ago.
So i wonder if anyone had hard-data about some min-max equivalent
algorithms using winrate, and light-simulations.
I'd like to know
From: Don Dailey [EMAIL PROTECTED]
I've always had this idea that the best way to build a book might also
be the best way to build a game playing program. For instance we have
done these big studies to determine based on games of Leela and others
what the best main line of play is.
On Sun, 2008-10-12 at 08:08 -0700, terry mcintyre wrote:
From: Don Dailey [EMAIL PROTECTED]
I've always had this idea that the best way to build a book might also
be the best way to build a game playing program. For instance we have
done these big studies to determine based on games
From: Don Dailey [EMAIL PROTECTED]
On Sun, 2008-10-12 at 08:08 -0700, terry mcintyre wrote:
Yes, there are analogies. The databases of games in Chess include many
high-quality grandmaster-level games, do they not? I hope that Go databases
also
sample professional Dan-level games,
