Computer Chess Club Archives

Search

Terms

Messages

Subject: Does this make any sense? Anyone tried?

Author: Jari Huikari

Date: 06:27:17 11/25/99

Assume that chess program N is playing a game with SLOW time controls.
Number of nodes grows exponentially when search goes iteratively deeper.
Program N thinks that best move is A. However A leads to loss, but behind
the horizon of N.

It would take terribly much time for N to search deep enough to avoid
the bad move A. So it plays it and looses the game. (Also assume that
N haven't enough knowledge to avoid playing A.)

PERHAPS it could be avoided to play A, if program N tried to PLAY ON
the game for some moves. If it played on (with shallower search for
each halfmove), it could perhaps see that something very bad happens, if
it plays A.

What do you think?
					Jari

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.