Hello everyone,
I’ve created a site for creating and solving go problems with the help of a pre-calculated database.
Tiny go problems
The whole system is automated so there should be no dispute about the optimal solution and the interface is pretty minimal. If you have trouble finding the correct move, you can use the Book-option to play an optimal move. You can also use the Show result option to see what scores different moves achieve.
There are limitations of course. Only completely localized positions can be solved completely with reasonable resources so you won’t see any open ended or whole board problems here.
We use japanese rules where only completely surrounded areas count as territory. This means that eyes and false eyes in seki count towards the score including dead stones inside a seki. Sometimes you will also need to fill all dame to get the optimal solution. The computer may try to trick you by making points with false eyes.
The computer is programmed to give the longest resistance when solving the problem so it might be a little annoying, but try to take it as a motivation to minimize local ko threats.
The rules are a bit non-standard to make everything perfectly solvable. There are stones surrounded by a red border and by capturing them you win the game instantly. To simulate “the rest of the board” there are stones surrounded by a green border with liberties extending beyond the problem space. Such stones cannot be captured. You may also encounter corners of the board in weird positions.
At the time of writing there are over 800 problems in the collection. Mostly corner problems from Cho Chikun’s Encyclopedia of life and death and a few 4x4 problems.
I hope you enjoy working through the problems!