Author: Uri Blass
Date: 05:15:46 11/27/02
Go up one level in this thread
On November 27, 2002 at 07:57:09, Bruce Cleaver wrote: >I believe there have been world-class backgammon progs that used a 1-ply search; >i.e. all legal moves are explored to one ply and the best is played. I am not >sure what this tells us. The branching factor for backgammon is ~400, including >dice rolls and doubling cube. I think that this tells us that humans never knew how to learn backgammon seriously and programmers who thought about the problem could teach programs things that humans do not know. I think that it is also possible that in some games like backgammon part of the good players of today became good players thanks to the fact that they are good programmers and they started to learn the game by generating a program to calculate the right evaluation function and only later they learned the evaluation from their program to get an advantage against other humans. Uri
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.