Author: Andrew Wagner
Date: 23:14:53 01/10/06
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?
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.