![]() StartingPoints Paths Referenced by
|
Picky Endgame Problem
Difficulty: Dan level
Keywords: Problem, EndGame
A yose problem from Bill Spight - used by permission. The problem has virtually no practical value. ;-) The largest play is only slightly bigger than the second largest, and there are many whole board positions where the second largest play is correct. However, there are some interesting variations, and figuring out the largest play is a good exercise. :-)
The outer stones are alive. Which is the largest play for Black: a, b, or c? How much is it worth? For a discussion of the solution to this problem, see Picky Endgame Discussion. BillSpight: Hmmm. I just noticed that the actual solution is not given. Anyone care to give it a try? :-) Solution? This is a copy of the living page "Picky Endgame Problem" at Sensei's Library. (C) the Authors, published under the OpenContent License V1.0. |