Re: Sudoku
- From: Terence <tbwright@xxxxxxxxx>
- Date: Wed, 5 Dec 2007 14:33:20 -0800 (PST)
On Dec 6, 6:05 am, nos...@xxxxxxxxxxxx (Spam Killer) wrote:
On Wed, 05 Dec 2007 18:55:21 +0100, Herbert Kleebauer wrote:
but there is an additional requirement for solving it. The colors do
matter. The numbers 1-9 must appear in every color only once, and
this variation seems to be relatively new. I've only seen this one so
far.
Which colors?
color 1 color 2 color 3 ...
color 4 color 5 color 6 ...
color 7 color 8 color 9 ...
color 1 color 2 color 3 ...
...
in each of the squares.
--
wfz
The 3x3 subsquares and the rows and the columns are what the oriental
fans call "houses".
Other names are SQUARE, ROW, COLUMN and the 81 items are BOXES.
I uses alternate colours myself, like a chess board, when displaying
sets of possible digits per box in partial solutions.
The preferred oriental way of solving is to use a 3 by 3 dot array in
each BOX to represent possible digits, and crossing a dot (or filling
a tiny circle) if a possibility is eliminated
123
456
789
I still trying to understand Herbert's strange code. It does seem to
be pure X86; possibly 32 bit asm.
I'm really more interested in the algorithm he mentioned (which does
involve guessing when stuck; I'm trying to find rules to get past that
part). My "HARD" examples all need a guess except for one.
.
- Follow-Ups:
- Re: Sudoku
- From: Herbert Kleebauer
- Re: Sudoku
- References:
- Re: Sudoku
- From: Terence
- Re: Sudoku
- From: Terence
- Re: Sudoku
- From: Herbert Kleebauer
- Re: Sudoku
- From: Spam Killer
- Re: Sudoku
- From: Herbert Kleebauer
- Re: Sudoku
- From: Spam Killer
- Re: Sudoku
- Prev by Date: Re: simple read char app return wrong value?
- Next by Date: Re: TitsandAsm
- Previous by thread: Re: Sudoku
- Next by thread: Re: Sudoku
- Index(es):
Relevant Pages
|