Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Compute Power Affects Search Heuristics

Author: Steve Maughan

Date: 01:37:12 12/23/98

Go up one level in this thread


Yes it is interesting that as computing power increases, the best algorithms
change.  I am not sure of any other area of computing where this is the case.
Back in the days of 8bit 6502s and Z80s a brute force approach seemed to work
and nobody had time for selective extensions.  Then came 16 bit and the
asymetric search of Richard Lang, Null move and selective extensions.  BTW I
think the problem that Richard Lang has had to improve Genius 3 over the last
couple of years stems from his dependence upon the asymetric search which may
have been squeezed for all its got.  I think he may have to convert to a new
paradigm to improve on Genius 3.  The Deep Blue team obviously think that Null
move is not appropriate for their computing power.  Personally I think Null move
is likely to stay for quite a while as it seems to be quite a "human" thought
process eg if I move my knight to g5 then I can move to f7 next move that looks
interesting.

Steve Maughan



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.