[computer-go] Test position set for MC programs

[Gunnar Farnebäck]

Don Dailey wrote:
 > Go problems don't work for MC programs unless you can arrange them so
 > that finding the right move wins, and anything else loses.   I found you
 > can modify some problems by manipulating the komi to make this true.

You can manipulate komi to turn any unfinished position into a
win/lose testcase. It might not have a unique solution but that's not
required for a testcase to be useful.

The difficulty is of course to find the proper komi so that the
minimum number of moves are winning moves, and to find which those
moves are. If you can do that you will in most cases get an
interesting testcase.

/Gunnar