Author: Vincent Diepeveen
Date: 19:28:50 05/19/04
main() {
search(10); // search 10 ply depthfirst
for i = 1 to 10 // depth limited 1..10 ply search
search(i);
}
search(int depth) {
if depth == 0
then return eval();
else for all moves
search(depth-1);
}
Robert Morgan Hyatt doesn't seem to understand this in his thesis.
This page took 0.01 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.