Starting with this problem, I'll try to make a 4x4 problem out of each letter. I don't know if it's possible, but even trying should be fun :) To start with, here is an easy "A".
Please find White's best result!
(japanese rules)
(;GM[1]FF[4]CA[UTF-8]AP[CGoban:2]ST[2]
RU[Japanese]SZ[4]KM[0.00]
PW[Weiß]PB[Schwarz]AW[cb][cc]AB[ba][ab][ac][bc][ad][cd]C[White to move - what's the best he can do?]PL[W]
(;W[ca]CR[ca]
(;B[bb]CR[bb]
;W[dc]CR[dc]
;B[db]CR[db]
;W[da]CR[da]C[Seki, White wins by one point (the prisoner) RIGHT])
(;B[dc]CR[dc]
;W[bb]CR[bb]
;B[db]CR[db]
;W[aa]CR[aa]C[White wins big, B D2 was bad!]))
(;W[bb]CR[bb]
;B[ca]CR[ca]
(;W[dc]CR[dc]C[Seki & Jigo!])
(;W[db]CR[db]C[Seki & Jigo!]))
(;W[dc]CR[dc]
;B[ca]CR[ca]
;W[bb]CR[bb]C[Seki & Jigo!])
(;W[dd]CR[dd]
;B[dc]CR[dc]
;W[db]CR[db]
;B[bb]CR[bb]
;W[dd]CR[dd]
;B[bd]CR[bd]
;W[ca]CR[ca]
;B[dc]CR[dc]C[Black wins!]))