Author: Greg Lazarou
Date: 19:42:48 05/24/99
Go up one level in this thread
Well, I see all kinds of implementation difficulties with the take-back approach. How about something much simpler: do tournaments with fixed-depth or even better, "fixed-number-of-search nodes per move" controls instead of time. So lets say you allow a max of 1,000,000 nodes per move, now the more intelligent program in terms of positional evaluation, extensions etc. gets to spend its alloted nodes in the best way to come up with the move. This implies a level of trust between the competitors, since it is going to be pretty easy to cheat, but continuous improvement in positional evaluation and better heuristics would be the only way to improve your results in this type of game. Clear definitions of what is meant by "node" etc. would also be needed... Greg
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.