Here
http://www.research.att.com/~gsf/man/man1/sudoku.html
you can find a very rapid and powerful solver.
There are commands like:
EXAMPLES
Note: % must be entered as %% in windows .bat files and shortcut commands.
Generate 100 minimal symmetric puzzles limited to pairs and x-wings in g.dat:
sudoku -g -sg -m -q+T2H2W2-XYG -e "valid&&minimal==1" -n100 -f%v -o g.dat
Reformat and collate for player's forum inferior low/high steppers:
sudoku -f"%#tq,%(steps)x,%(clues)x,%(minimal)[-][M][SM]x,%#0v,gsf,%n" \
-q{FN}-G -B *.dat | sort -t, -k1,1 -k2,3n -k4,4r
Generate and search for player's forum ulterior low/high steppers:
sudoku -f"%#tq,%(steps)x,%(clues)x,%(minimal)[-][M][SM]x,%#0v,gsf,%n" \
-e"V&&(I<4||I>20)" -g -q{B2:N}-G -Q!{FN} -AB -m -sg
Count isomorphic puzzles and list each non-trivial representative:
sudoku -f"%C %c %4n %#0v" *.dat |
sort -k1,1 | uniq -c -s82 -w82 | grep -v "^ *1 "
Count isomorphic solutions and list each non-trivial representative:
sudoku -f"%C %c %4n %#0v" *.dat |
sort -k1,1 | uniq -c -w82 | grep -v "^ *1 "
Solve and categorize a collection of puzzles:
sudoku -F"# %t seconds" -f"%v # %7n %10t %Q" puzzles.dat > puzzles.out
Label and trace constraint interations:
sudoku -ki -v2 puzzle.dat | less
Capture the pencilmark grid after constraint iteration N:
sudoku -kiN -f%#ph puzzle.dat
Havard's "Making 17's from JPF's 19" sequence:
sudoku -go"{-1+1}x3{-2+1}{-2+2}{1+1}x9" jpf-19.dat
Generate 10 non-equivalent mimimal symmetric puzzles, each solved by a
different set of constraints, with the same solution grid as the
first puzzle in s.dat:
sudoku -gp -Ys.dat -j0 -n10 -m -sg -e 'minimal==1&&uniq()&&uniq(%q)'
Filter weak and strong pearls:
sudoku -S -qss+G -e '(%#Pq)>2'
Could you tell me how to reach this solver and install it in my computer?
Thank you
