Author: rasjid chan
Date: 10:50:45 04/10/04
Go up one level in this thread
On April 10, 2004 at 12:55:31, Russell Reagan wrote: >On April 10, 2004 at 10:37:25, rasjid chan wrote: > >>Anything that is not recursive would not be alphabeta and cannot be a search >>or something useful for chess programming. > >It is possible to write alpha-beta in an iterative form, and it would be equally >useful for chess programming as its recursive counterpart. Maybe like in C++. new a search object for every ply with a member search function... there should be ways around... my main idea is actually that we can't gain much ELO in this direction if this is only what we want. Unless he is out to get something which can be nothing less than a breathrough in chess tree search. Rasjid
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.