Author: José de Jesús García Ruvalcaba
Date: 02:12:35 08/02/01
Go up one level in this thread
On August 01, 2001 at 14:05:18, Uri Blass wrote: > >Why? >If the evaluation is a random number I see no reason for prefering moves that >increase the mobility. > >If you assume that the program evaluates checkmates correctly then it s clear >that it plays better than rabdom moves because it is going to never miss a >simple forced mate so you do not need to use mobility. > >Uri 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é.
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.