tag: Behting study - Page 1

John Nunn: 'The Behting study is sound'

10/5/2012 – In August we published a study that we have been using for almost three decades as a challenge for computers to solve. However endgame and study expert John Nunn suggested that there might be an alternative solution to the study. After extensive analysis and with the help of some of our readers Dr Nunn has now come to the conclusion that the study is after all correct. Astronomical update.

The Behting study – solution and a search for cooks

8/7/2012 – Can we still deceive computers in chess, asked Kiyoshi Takahashi in a recent article? To his entertaining examples we tacked on a famous study which has been fooling computers – for thirty years now! Today we bring you the incredibly deep solution and also ask you to participate in a minor research project: to find out if the study is cooked. Is there a second move that secures the same result?

Can we still deceive computers in chess?

7/17/2012 – Today the best players in the world would balk at playing against a strong chess program. But are there any positions or ideas left that computers cannot figure out? Kiyoshi Takahashi has put together some elementary themes that traditionally posed problems for computers. To this we have added a study which for almost thirty years has genuinely stumped our electronic friends.
1