Author: John Coffey
Date: 13:27:58 06/19/00
Let us say that I have a system with not much RAM, like the Gameboys that I program. Transposition tables are out of the question. The Gameboy Advanced (16 mhz risc processor) has 1/4 meg available as an option that can be placed on an external cartridge, but I figure that is not enough to do anything. Here is what I am thinking for a chess program: Iterative iterative deeping. If I have a 7 play search, and I am at ply 4 deep, it would still do a 1 ply followed by a 2 ply folled by 3 ply to finish that branch of the tree. Of course I would give priority to checks and some captures. Would it help? John Coffey
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.