Author: Stuart Cracraft
Date: 13:32:50 12/15/05
Go up one level in this thread
On December 15, 2005 at 16:24:47, Dann Corbit wrote:
>On December 15, 2005 at 15:55:03, Andrew Wagner wrote:
>
>>Let your imaginations roll for a moment.
>>
>>First, imagine that a perfect SEE algorithm existed. That is, given any
>>position, and a side to move, you could decide which piece to move without doing
>>any searching, and get it right 100% of the time. Now your search tree is down
>>to a branch with an ammortized size of about 12 branches per position (maximum
>>of 27 moves for the queen, 14 for rook, 13 for bishop, 8 for knight, 8 for king,
>>3 for pawn) with an average case in the middle game much lower. You still have
>>to search those 12 branches or whatever, but you're always only searching moves
>>for a single piece per node.
>>
>>Now, take a typical modern engine, with or without a typical SEE algorithm, and
>>fitted it with this new, perfect SEE. How much improvement would you see, if
>>any?
>
>A perfect {extended} SEE would win/lose/draw the game perfectly at the opening
>position.
>
>Only I would call it BMOGEN (Best move only generator).
>
>Nobody has one that makes no mistakes yet. Was it Capablanca who said:
>"I only consider one move... the BEST one."
Yep - he did.
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.