This page is only understandable by go players.
I'm interested in the game of Go as it's a good testbed for computer science - whereas in chess computers are stronger
than humans (by far), computers are still weak in the game of Go. In particular, they sometimes make errors in ladders.
Below, a beautiful ladder problem, generated by computer scientists.
I don't give the reference, so that nobody can cheat by looking at the answer,
I hope that the authors of this ladder will forgive me :-)
If you have comments on this, please email me olivier.teytaud@gmail.com (in particular if you try to solve it).
Question: black plays. Can black kill the left white stone marked with a triangle ?
High quality version of the image: http://www.lri.fr/~teytaud/goladder.jpg
