
Folks: For research on the behavior of parallel Haskell, does anyone know of a source for graded (easy through evil) 16x16 Sudoku puzzles? Our hardware runs too fast for us to get meaningful timings on 9x9's. I suppose we could insert time wasters, but I think that would also distort the results . . . . Thanks in advance, Murray Gross Brooklyn College

Simon Tatham has a sudoku program which generates Sudoku's of any size in
varying difficulties:
http://www.chiark.greenend.org.uk/~sgtatham/puzzles/
It's down at the bottom and is called Solo.
I can't speak to the actual quality/difficulty of the puzzles, but every
feature you asked for is there plus unlimited puzzles.
----- Original Message -----
From: "Murray Gross"
Folks:
For research on the behavior of parallel Haskell, does anyone know of a source for graded (easy through evil) 16x16 Sudoku puzzles? Our hardware runs too fast for us to get meaningful timings on 9x9's. I suppose we could insert time wasters, but I think that would also distort the results . . . .
Thanks in advance,
Murray Gross Brooklyn College
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Nice set of games :)
Truly a source of inspiration for programming.
/Gianfranco
On Fri, Oct 3, 2008 at 5:11 AM, David Stigant
Simon Tatham has a sudoku program which generates Sudoku's of any size in varying difficulties:
http://www.chiark.greenend.org.uk/~sgtatham/puzzles/
It's down at the bottom and is called Solo.
I can't speak to the actual quality/difficulty of the puzzles, but every feature you asked for is there plus unlimited puzzles.
----- Original Message ----- From: "Murray Gross"
To: Sent: Thursday, October 02, 2008 7:47 PM Subject: [Haskell-cafe] Source of 16x16 Sudokus? Folks:
For research on the behavior of parallel Haskell, does anyone know of a source for graded (easy through evil) 16x16 Sudoku puzzles? Our hardware runs too fast for us to get meaningful timings on 9x9's. I suppose we could insert time wasters, but I think that would also distort the results . . . .
Thanks in advance,
Murray Gross Brooklyn College
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- Patience is the last resort for those unable to take action

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Gianfranco Alongi wrote:
Nice set of games :)
Truly a source of inspiration for programming.
I'm particularly fond of his "Minesweeper" game that has the ability to generate guaranteed-solvable puzzles (every bit as challenging as a regular Mines game, but without the chance that you'll actually be truly forced to guess). Simon Tatham, of course, is also the author of PuTTY. Also, I discovered the "divide-and-conquer" method for counting the number of set bits in a bit-vector by looking through the sources for "Mines". - -- Micah J. Cowan Programmer, musician, typesetting enthusiast, gamer. GNU Maintainer: wget, screen, teseq http://micah.cowan.name/ -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.7 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFI5lmV7M8hyUobTrERAueQAJ9eerZ6V6Klrtr4wVxoT305eBsM2QCeOVpT 6CTeEBsuxYwv0MntiKsnJDM= =v+Lf -----END PGP SIGNATURE-----
participants (4)
-
David Stigant
-
Gianfranco Alongi
-
Micah Cowan
-
Murray Gross