Author: Jan Pernicka
Date: 04:08:12 04/13/00
Hi,
I would like to know if and how chess programs use randomness when
searching. Several points comes to speak about:
1) choosing the move from openning book (it's not interesting even if you
are changing probability of choosing particular move)
2) choosing move when playing out of book (ie: you have several moves
with similar score - pick anyone...)
3) (questinoable) - to add little random number when evaluating position
Especially interesting is point 2)
To be able to do it I tried this:
a) to search with alfa slightly lower than would normal be (not to cause
cutoff in moves you want to choose from...)
b) search normaly and after finding best move - finding other moves
with help from narrow window
But - is such randomness commonly used?
During turnament probably not - it's waste of time, but what about
programs on chess servers - they would probably without this make
the same mistake again and again - even when you "correct" your
opening book as in point 1).
So thanks for any comments
Jan
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.