I had mild success (on a sample of one) proceeding as follows: s=: - 0=9 9 [EMAIL PROTECTED] 3
The puzzle will be 9 by 9 with _1 indicating black and 0 indicating white. Then: - change one cell of 2 by 2 blocks of blacks into a white - change whites into blacks as necessary so that all the blacks are connected When the above settles down, count the cells in each white island and replace one cell in a white island by its count. The puzzle is then p=:0>.s whose solution is s . p=: ".;._2 (0 : 0) 0 0 0 0 0 0 0 4 0 0 0 0 7 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 4 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 0 0 1 0 0 0 0 0 0 0 ) In this process the verbs islands and check from http://www.jsoftware.com/jwiki/Essays/Nurikabe#Solver are useful. ----- Original Message ----- From: Oleg Kobchenko <[EMAIL PROTECTED]> Date: Wednesday, October 22, 2008 21:51 Subject: [Jprogramming] Nurikabe Generator To: Programming forum <[email protected]> > It may sound offbeat, but is there a Nurikabe Generator? > As I understand, it may involve some heuristics itself. > Any ideas? ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
