Author: Olaf Jenkner
Date: 10:53:34 08/08/01
Go up one level in this thread
>Hi Uri! >Make a simple model, a two-ply alpha-beta search with random evaluation of the >leaf nodes, independent and equally distributed (those are standard >assumptions). >It is very easy to prove that the move that the move that gives the opponent the >lower number of replies has a higher probability of being chosen. >For deeper searches it is more complicated, but the mobility principle still >holds. >José. I read an article in ICCA-Journal maybe 10 years ago. They showed by experiments that the playing strength increases with every ply more. Can anyone build me a Crafty-clone with random evaluation? I would like to do some experiments. By the way, maybe I will win my first game against Crafty. OJe
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.