Author: Uri Blass
Date: 20:49:59 12/12/02
Go up one level in this thread
On December 12, 2002 at 17:17:04, Dann Corbit wrote: <snipped> >>[D]k7/P2ppp2/K7/8/8/8/7P/8 w - - 0 1 >> >>I can see mate in 5 without calculating all the tree >> >>1.h4,2.h5 3.h6,4.h7,5.h8R# >> >>a stupid computer program(and I believe that all of the available programs are) >>need to calculate a lot of lines(1.h4 f5,1.h4 f6,....) > >You have to calculate the square root of the nodes of the tree. Not the full >tree. No In this case there is a simple plan 1.h4 2.h5 3.h6 4.h7 5.h8Q# It is easy to see that black can do nothing against it without calculating. I need only to look at class of positions and not on specific positions. Here is the proof of the mate in 5. 1.h4 black has 3 pawns at f,g,h files but the pawns did not go after f5,g5,h5 2.h5 black has 3 pawns at f,g,h files but the pawns did not go after f4,g4,h4 3.h6 black has 3 pawns at f,g,h files but the pawns did not go after f3,g3,h3 4.h7 black has 3 pawns at f,g,h files but the pawns did not go after f2,g2,h2 5.h8R# I do not know of computers that calculates in that way but it is theoretically possible to do it. If chest can do it then it can be faster but I have not simple idea how to detect patterns like this pattern. <snipped> >>Another simple example >>[D]7k/8/1p1p1p1p/pPpPpPpP/P1P1P1P1/8/8/6KR w - - 0 1 >> >>It is simple to prove that it is a draw without tree or tablebases. > >This is a terminal game condition. It could be added via a recognizer. We >could say at this point that the game is concluded, but it might be necessary >via the rules to either repeat 3-fold or 50 move rule. In this case it is a draw only if we assume that the rook is not captured by a pawn but we can assume perfect moves by both sides and black does not have to capture the rook. <snipped> >We could include a "wall + insufficient material to break the wall" recognizer. >I suspect that it will slow down the search, rather than speed it up. It is dependent how it is used. If it is used at every node then it is going to slow the search. If it used only at nodes that are close to the root it is not going to slow the seacrch. <snipped> >I have retracted the "solution is technically infeasible" claim. I change it to >"incredibly unlikely". I agree that it is incredbly unlikely that chess is going to be solved but my point is that tree of chess positions+tablebases is not the only way to try to solve the game. 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.