Open Internet by MindsNet

Optimal Solution for Capturing Stones on n x n Go/Baduk Boards

The problem is to find the minimum number of white stones that must be removed so that black can capture all the remaining stones on an n x n Go/Baduk board. This is an open problem in the field of discrete mathematics, with solutions for 13x13 and 19x19 boards already known.

Mathematics & logic, Mathematics, Discrete Mathematics