![]() StartingPoints Referenced by
|
RTG Problem 14 Attempts
unkx80: I am not sure whether the above diagrams count as solution. I believe it might count as a solution on the condition that following ladder does not work for Black.
a and b miai. Black c, White plays at SnotNose: a and b aren't miai. White always has d to take away the eye at the edge.
unkx80: Besides, what happens when
unkx80: Problem is, solution should not be a ko.
Dave: I can't figure out how Black lives against this
unkx80: How do you answer Dave: We don't? :-) So...
Dave: We descend to the edge. This puts meaning back into the marked stone at least :-) First let's look at that troublesome diagonal play that spoiled my last idea... After
Dave: If
Dave: Instead White plays
Dave: The diffence between this
Dave: In answer to unkx80: Both of you have got it for both the problems. =) Dave: Note for readers. Sometimes we see the advice that we should solve problems in our heads to get the most out of them. That is what I normally do when I go through books (of course it is a little hard to carry a board on the subway :-). But our brains alone will only carry us so far - or else we would all be 9 dans, right? Sometimes you just need to dig if you are have any hope of solving it. I analyzed this problem in CGoban. The resulting sgf file (just variations, no text) is 8KB - as long as some reviews that I have written for the go teaching ladder. Sometimes there is no substitute for persistence :-) This is a copy of the living page "RTG Problem 14 Attempts" at Sensei's Library. ![]() |