Author: Steve Maughan
Date: 05:30:04 10/31/00
In my chess program I use recursion to carry out the basic alpha beta search. However while on one of the Delphi newsgroup I was told that recursion is a source of significant inefficiency and that _ALL_ recursive algorithms can be converted into an iterative form that is generally faster. Upon searching the net I found this site: http://www.geocities.com/zabrodskyvlada/aat/a_recu.html This basically shows that the recursive version of a sort runs at half the speed of the alternative version. Moreover, thinking back I remember that Ed Schroder mentioned that he doesn't use recursion. How many people do use recusion? Is there any literature on non recursive alpha / beta? Has anyone done any comparisons between recursive and none recursive searches? Regards, Steve
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.