NB. n > 10 is allowed: http://www.patrickmin.com/calcudoku/en/2010-09-24/10/3
R.E. Boss > -----Oorspronkelijk bericht----- > Van: [email protected] [mailto:[email protected]] Namens > Roger Hui > Verzonden: vrijdag 24 september 2010 19:09 > Aan: Chat forum > Onderwerp: Re: [Jchat] calcudoku > > For example: > > 0. Start with (n,n)$<1+i.n as the matrix of possibilities. > Since n is at most 10 even a brute-force approach > can be effective. > > 1. Eliminate possibilities per the specified constraints. > Sometimes the elimination works on groups of cells. > e.g. A group labelled 10x in a 6-by-6 puzzle would have > the following possibilities: > 2 5 > 5 2 > > 2. If there is only one possibility left for a cell then that's > the answer for the cell. > > 3. Stop when the cells all have one possibility each. > > > > ----- 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 ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
