Author: James Swafford
Date: 17:55:15 04/10/04
Go up one level in this thread
On April 10, 2004 at 09:39:59, James Swafford wrote: duh :) >On April 10, 2004 at 07:17:24, Uri Blass wrote: > > >By 'non recursive search', are you saying you want code that >(re)implements search( ) for every possible depth? > >-- >James > > >>Recursive search is basically a mistake because it means that the computer >>remember every information twice(it remember beta and later alpha as minus beta >>and it is a waste of memory). >> >>people claimed in the past that it is more simple to do a recursive search but I >>believe that everything is simple after you understand it so it should not be a >>problem. >> >>I think that the only reason that people think that recursive search is simpler >>is that they are used to recursive search and not to non recursive search. >> >>My question is if there is a single free program that use alphabeta without >>recursive search(it does not have to be a chess program and can be a program in >>every thinking game). >> >>I try to figure out how basic alphabeta without recursive search should be done >>It will be productive if somebody can give a code for non recursive search that >>allow extensions and null move pruning. >> >>Uri
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.