Disclaimer: I am not a mathematician, but I think this open problem might interest some people on this forum.
First, the problem for those who already know the rules of Go/Baduk: what is the minimum number of white stones that must be removed so that black can capture all the remaining stones?
The answers for 13x13 and 19x19 boards can be found at the following link.
www.reddit.com/r/baduk/s/NZ6xYvvXE7
Now, the real problem: what is the optimal solution for n x n boards?
Another interesting theoretical problem: is there a pattern that allows for the collapse of an infinite board with no edges or corners? (Since stones on the edges and in the corners are weaker).
For those unfamiliar with Go/Baduk: the basic rules for solving the problem are simple. To capture a white stone, you must remove its four "liberties" (each of the lines extending from an intersection) by surrounding it with black stones. However, you cannot play a black stone directly onto a point where it would have no available liberties itself. Such points—where the opponent has no liberties—are called "eyes." In the image, all the available empty spaces are eyes.
Therefore, some white stones must be removed first to allow black stones to be placed on certain empty intersections. That said, you *can* place a black stone inside an eye if doing so removes the last liberty of a white stone, thereby capturing it.
Once captures begin, the process continues as long as the stones can encroach upon the liberties of other stones. Conversely, if they encounter a boundary where all stones possess two eyes, the capturing stops, as it is only possible to attack one eye per turn.
Now, a bit of context:
I am learning Go/Baduk, and this problem arose while I was trying to understand liberties and eyes. It started as a mere curiosity, but some interesting patterns emerged. Unfortunately, I don't have the mathematical knowledge to delve deeper into the subject, but I think it might be of interest to some people on this forum. Cheers!
