PDA

View Full Version : Can computers solve this study?



Tantale
04-09-2012, 07:33 PM
http://cjoint.com/12sp/BIelF51v79S_fine.jpg

Reuben Fine 1941

8/p6p/2k3p1/4Pp2/2K2P1P/6P1/8/8 w - - 0 1

White to move and win.

Solution here : http://www.jmrw.com/Chess/Kloch/base.htm
jmrw

Tony Dowden
06-09-2012, 05:20 PM
Wrong link?

Kevin Bonham
06-09-2012, 05:27 PM
Right link but you have to use the menu on the left to change "Startposition" from Bianchetti to Fine.

Tantale
06-09-2012, 06:32 PM
Wrong link?
No the link is ok
jmrw

FM_Bill
01-11-2012, 11:54 AM
The second position in the list
Lasker-Reicheim
is a standard position for chess programmers to see if the
hash tables are working properly. 1.Kb1 - the winning move, is unlikely to be found unless the engine sees the win of a pawn.

With hash-tables, Kb1 can be found in a split second, without it takes minutes.

The Fine position is not a good test as 1.Kb4 can be found without an engine seeing very deeply.