Page 2 of 2

Re: A Go Problem for you to solve!

Posted: Sat May 29, 2010 7:04 am
by Solomon
Jordus wrote:
This is like proving a theorem by writing "Suppose that" and nothing else.


I thought the read-out after that first move is blatantly obvious...

After reading what everybody else said... all but one. make that two, so far have read the same thing I have....

That's funny, because everyone prior to when you posted were also incorrect. I should also mention this is a dan-level problem.

Re: A Go Problem for you to solve!

Posted: Sat May 29, 2010 7:26 am
by GoCat
@hiyayang: Very nice. Now if I can just get to the point where I can do all that in my head, during a game....

Re: A Go Problem for you to solve!

Posted: Sat May 29, 2010 8:17 am
by MountainGo
I've been working on this, and I haven't found the solution yet, but I have the feeling it's going to be one of those ridiculously long, crazy ones.

Re: A Go Problem for you to solve!

Posted: Sat May 29, 2010 8:46 am
by Chew Terr
Hiyayang: Wow, even more complex than I'd thought!

Kirby:
Thanks, this is a really cool problem. It sprawls over a large scale and has a lot of things that seem to almost work, except for the hidden trap. Cool problem, thanks for sharing.

Re: A Go Problem for you to solve!

Posted: Sat May 29, 2010 9:10 am
by Solomon
Those who are up for a challenge may want to consider this slightly different problem (also cut away the excess from Kirby's problem with a shorter ladder-breaker). The thing about the problem posted by Kirby is that E13 is suboptimal play from White in response to Black E14:

Click Here To Show Diagram Code
[go]$$Bcm1
$$ -------------------------
$$ | . . . . . . . . . . . .
$$ | . . O O . . . O O . . .
$$ | . . O X X X X X O . O .
$$ | . . . O O O X O X X . .
$$ | . . . . X X O O . . . .
$$ | . . . . . . . . . X . .
$$ | . . . . . . . . . . . .
$$ | . . . . . . . . . . O .
$$ | . . . . . . . . . . . .[/go]

Re: A Go Problem for you to solve!

Posted: Sat May 29, 2010 11:39 am
by Tommie
I was very happy & proud
when I solved that problem some 5 years ago (found the first move),
then another one
and made some small error some 20 moves later.

Re: A Go Problem for you to solve!

Posted: Sat May 29, 2010 12:22 pm
by HermanHiddema
Araban wrote:Those who are up for a challenge may want to consider this slightly different problem (also cut away the excess from Kirby's problem with a shorter ladder-breaker). The thing about the problem posted by Kirby is that E13 is suboptimal play from White in response to Black E14:

Click Here To Show Diagram Code
[go]$$Bcm1
$$ -------------------------
$$ | . . . . . . . . . . . .
$$ | . . O O . . . O O . . .
$$ | . . O X X X X X O . O .
$$ | . . . O O O X O X X . .
$$ | . . . . X X O O . . . .
$$ | . . . . . . . . . X . .
$$ | . . . . . . . . . . . .
$$ | . . . . . . . . . . O .
$$ | . . . . . . . . . . . .[/go]


Click Here To Show Diagram Code
[go]$$Bcm1
$$ -------------------------
$$ | . . . . . . . . . . . .
$$ | . . O O . . . O O . . .
$$ | . . O X X X X X O . O .
$$ | . . . O O O X O X X . .
$$ | . . . . X X O O . . . .
$$ | . . . . 1 8 3 4 7 X . .
$$ | . . . 2 x 9 6 5 . . . .
$$ | . . . . . . . . . . O .
$$ | . . . . . . . . . . . .[/go]


Ko.

:w2: at x, as Kirby has it, is much harder to punish, but if punished correctly leads to unconditional capture of the white stones. This :w2: is also a double ladder breaker, but it only gives black a ko, instead of an unconditional kill

Re: A Go Problem for you to solve!

Posted: Mon May 31, 2010 5:41 pm
by Kirby
Congratulations to hiyayang, who got the solution correct.

For completeness, the solution to the problem that I originally posed is as follows (which is basically that which hiyayang has already explained).
Click Here To Show Diagram Code
[go]$$Bcm1
$$ ---------------------------------------
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . O O . . . O O . . . . . . . . . . |
$$ | . . O B B B B B O . O . . . . X . . . |
$$ | . . . O O O B O X X . . . . . , . . . |
$$ | . . . . X X O O 7 . . . . . . . X . . |
$$ | . . . . X 5 2 1 6 X . . . . . . . . . |
$$ | . . . . O . 3 4 0 . . . . . . . . . . |
$$ | . . . . . . . 9 . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . , . . . . . , . . . . . , . . . |
$$ | . . . . . . . . . . . . . . O . . . . |
$$ | . . . . . . . . . . . . . O . . . . . |
$$ | . . . . . . . . . . . . O . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . , . . . . . , . . . . . , . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ ---------------------------------------[/go]


:w8: at :b1:.

Click Here To Show Diagram Code
[go]$$Bcm11
$$ ---------------------------------------
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . O O . . . O O . . . . . . . . . . |
$$ | . . O B B B B B O . O . . . . X . . . |
$$ | . . 7 O O O B O X X . . . . . , . . . |
$$ | . . 9 8 X X O O X . . . . . . . X . . |
$$ | . . . 0 X X O O O X . . . . . . . . . |
$$ | . . . . O 3 X O O . . . . . . . . . . |
$$ | . . . . . 5 2 X 4 1 . . . . . . . . . |
$$ | . . . . . . . 6 . . . . . . . . . . . |
$$ | . . . , . . . . . , . . . . . , . . . |
$$ | . . . . . . . . . . . . . . O . . . . |
$$ | . . . . . . . . . . . . . O . . . . . |
$$ | . . . . . . . . . . . . O . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . , . . . . . , . . . . . , . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ ---------------------------------------[/go]


Click Here To Show Diagram Code
[go]$$Bcm21
$$ ---------------------------------------
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . O O . . . O O . . . . . . . . . . |
$$ | . . O B B B B B O . O . . . . X . . . |
$$ | . . X O O O B O X X . . . . . , . . . |
$$ | . . X O X X O O X . . . . . . . X . . |
$$ | . 3 2 O X X O O O X . . . . . . . . . |
$$ | 8 6 4 1 O X X O O . . . . . . . . . . |
$$ | 9 7 5 0 . X O . O X . . . . . . . . . |
$$ | . . . . . . . O . . . . . . . . . . . |
$$ | . . . , . . . . . , . . . . . , . . . |
$$ | . . . . . . . . . . . . . . O . . . . |
$$ | . . . . . . . . . . . . . O . . . . . |
$$ | . . . . . . . . . . . . O . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . , . . . . . , . . . . . , . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ ---------------------------------------[/go]


Click Here To Show Diagram Code
[go]$$Bcm31
$$ ---------------------------------------
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . O O . . . O O . . . . . . . . . . |
$$ | . . O B B B B B O . O . . . . X . . . |
$$ | . . X O O O B O X X . . . . . , . . . |
$$ | . . X O X X O O X . . . . . . . X . . |
$$ | 1 X O O X X O O O X . . . . . . . . . |
$$ | O O O 2 O X X O O . . . . . . . . . . |
$$ | X X X O . X O . O X . . . . . . . . . |
$$ | . . . 3 . . . O . . . . . . . . . . . |
$$ | . . . , . . . . . , . . . . . , . . . |
$$ | . . . . . . . . . . . . . . O . . . . |
$$ | . . . . . . . . . . . . . O . . . . . |
$$ | . . . . . . . . . . . . O . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . , . . . . . , . . . . . , . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |
$$ ---------------------------------------[/go]