Author: Geoff
Date: 06:55:13 04/18/03
Hi
I have just started my first few tentative steps of trying to figure out how
to write a computer chess program. Its going fairly well but I hit a slight
snag. I have been starting off by reading and using Tom Kerrigan's excellent
program. I have begun by using a simple Negamax search that looks at every
possible node, I have added a counter for the number of nodes searched.
When I print this out for a 1 ply search from the normal start position I
get the expected
1 ply = 21 I.E root node + 20 white moves (16 pawn moves and 4
knight moves)
however, my program gives me
2 ply = 421
3 ply = 9,323
4 ply = 206,604
I suspect my figures for ply's 2 to 4 are wrong, but it is dificult to prove
one way or another ?
Can anyone confirm whether these figures are right or wrong ?
Thanks for any help
Regards Geoff
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.