Author: Dan Honeycutt
Date: 09:33:04 01/11/06
Go up one level in this thread
On January 11, 2006 at 02:14:53, Andrew Wagner wrote: >This is going to sound like a really odd question. That's because it is. But I >really do have a good reason for asking it. Anyway, here goes... > >Is it feasible to implemet a typical alpha-beta search in an iterative fashion? >I'm not talking about iterative deepening, but I want to do alphabeta without >any recursion. If it's possible, can you give me a suggestion what it might look >like? Hi Andrew You can see an implementation of a non-recursive alpha-beta search in the Spracklin's book, "Sargon, A Computer Chess Program". I thought it was available on-line somewhere, but a quick google search failed to find it. Best Dan H.
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.