Inspired by problem 9908. How many stones can Black cut? Assume White's bottom group (J11, K11, L11) can live.
Please flag or comment if there is a mistake.
(
; AB[hb][hc][hd][he][hf][hg][hh][hi][lb][lc][ld][le][lf][lg][lh][li][ib][kb] AW[ic][jc][kc][if][jf][kf][ii][ji][ki]
C[How many stones can Black cut? Assume White's bottom group (J11, K11, L11) can live.FORCE]
LB[ho:0]LB[jo:3]LB[lo:6]
(; B[jo]; W[jp] C[Correct! Play on the triangled moves to see why.] TR[jd]; B[jd]; W[id] TR[ie]; B[ie]; W[kd] TR[ke]; B[ke]; W[je] TR[jg]; B[jg]; W[ig] TR[ih]; B[ih]; W[kg] TR[kh]; B[kh]; W[jh] TR[jb]; B[jb]; W[jg] TR[jd]; B[jd] C[RIGHT I could not let you play it out because there are thousands of different ways for Black to cut. And while I could use a computer program to generate the SGF code, that would make the solution tree too large.])
(; B[ho] C[Nope, you can cut some stones.])
(; B[lo]; W[lp] C[Prove it.] (; B[id]; W[jg])(; B[ie]; W[jg])(; B[jd]; W[jg])(; B[je]; W[jg])(; B[kd]; W[jg])(; B[ke]; W[jg])
(; B[ig]; W[jg]; B[jh]; W[kh]; B[kg]; W[ih] C[Nope.])
(; B[ih]; W[jh]; B[jg]; W[kg]; B[kh]; W[ig] C[Nope.])
(; B[jg]; W[ig]; B[ih]; W[kg]; B[kh]; W[jh] C[Nope.])
(; B[jh]; W[ih]; B[ig]; W[kh]; B[kg]; W[jg] C[Nope.])
(; B[kg]; W[jg]; B[jh]; W[ih]; B[ig]; W[kh] C[Nope.])
(; B[kh]; W[jh]; B[jg]; W[ig]; B[ih]; W[kg] C[Nope.])
)
)