A solution has been posted to http://www.jsoftware.com/jwiki/Essays/KenKen The algorithm is similar to the one I used to solve Sudoku, viz., use deductions to reduce the number of possibilities as much as possible, then "guess" by fanning out the cage with the smallest number of possibilities.
For example, for the sample puzzles in the Essay, KenKen kk0 1 2 4 3 4 3 2 1 2 1 3 4 3 4 1 2 KenKen kk1 3 2 6 1 4 5 6 5 1 4 2 3 2 3 5 6 1 4 5 1 4 2 3 6 4 6 2 3 5 1 1 4 3 5 6 2 KenKen kk2 2 6 3 5 8 4 1 7 8 3 2 6 7 1 5 4 5 8 1 2 3 7 4 6 7 5 6 3 4 8 2 1 3 7 5 4 1 2 6 8 1 4 8 7 6 5 3 2 6 1 4 8 2 3 7 5 4 2 7 1 5 6 8 3 ----- Original Message ----- From: Roger Hui <[email protected]> Date: Friday, September 24, 2010 9:59 Subject: Re: [Jchat] calcudoku To: Chat forum <[email protected]> > I've seen KenKen on the Times before and I believe a J program > to solve it is not too difficult. (I have never actually > solved one.) > > > > ----- Original Message ----- > From: "R.E. Boss" <[email protected]> > Date: Friday, September 24, 2010 3:07 > Subject: [Jchat] calcudoku > To: 'Chat forum' <[email protected]> > > > Most, if not all of us have experienced Sudoku. > > > > Among the numerous variants I recommend calcudoku > > <http://www.patrickmin.com/calcudoku/> > > http://www.patrickmin.com/calcudoku/or whatever name is used. > > > > It looks a bit like doing math. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
