Page 3 of 3
Re:
Posted: Tue Dec 23, 2014 8:55 am
by tapir
EdLee wrote:Oh, good. The reader has to read a bit between the lines.
Must be an advanced problem then...
Re: The nearly minimal problem
Posted: Tue Dec 23, 2014 11:46 am
by MMaestro
fanfan wrote:
$$B
$$ --------------
$$ | X . . . . . .
$$ | . X O . . . .
$$ | . 1 O . . . .
$$ | . . . . . . .
$$ | . . . . . . .
$$ | . . . . . . .
$$ | . . . . . . .
- Click Here To Show Diagram Code
[go]$$B
$$ --------------
$$ | X . . . . . .
$$ | . X O . . . .
$$ | . 1 O . . . .
$$ | . . . . . . .
$$ | . . . . . . .
$$ | . . . . . . .
$$ | . . . . . . .[/go]
I believe I answered that position in the link
Re: The nearly minimal problem
Posted: Tue Dec 23, 2014 2:28 pm
by fanfan
Sorry, you are right. I missed it.
In this variation, it's ko. Can White get a better result than a ko? (I agree that Black cannot win the ko if there nothing else on the board).