Author: Rafael Andrist
Date: 06:27:20 01/11/03
Go up one level in this thread
On January 11, 2003 at 08:52:36, Jeroen Noomen wrote: >On January 11, 2003 at 08:31:44, Lieven Clarisse wrote: > >>This is most probably a well known position (pasted below). But ruffian resigns >>here (5 min/game PIII 450 64MB hash). I think this kind of situation can be >>easily dealt with: if the evaluation score for the initial position is equal to >>that, after 25 ply (for instance) for the best line, than the score for that >>position should set to 0.00. In other words, if the engine can't make any >>progress after a certain number of moves, it is draw; no mather how inbalanced >>the material is for both sides. > > >Might work for this position, doesn't work for millions of other positions. >Chess is a game that cannot be caught in a limited number of rules. A program >based on your proposal, will be much weaker than a program that doesn't do that. >Programming the exceptions in chess will do only harm to the general playing >strength. Detecting blocked positions of this kind is easy with some simple bitboard operations and it takes nearly no time. Recongizing that the rooks cannot get on the other side of the wall is a little bit harder and more time consuming, but it is only neccessary to check that if the position is blocked anyway. Also detecting other common and known endgame fortresses is fast when using bitboards. Of course you can never catch all exceptions, but to detect the most important ones only is not that time consuming. regards Rafael B. Andrist
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.