## Help me!

Everything about Sudoku that doesn't fit in one of the other sections

### Help me!

Code: Select all
`5..2..9...6..1..4...9..8..73..5..1...4..3..5...6..7..92..3..6...1..7..8...8..4..2`

This puzzle is not completely to become minimum.
Many of its number can delete, and to find the most difficult ~ not easy.
Eioru

Posts: 182
Joined: 16 August 2006

You can use gsf's solver.

It finds 227 minimals. According to its (new) rating those are the hardest (rated 99314, 99324 and 99364):
Code: Select all
`5..2.........1..4...9..8..73..5..1...4.....5...6.....92..3..6......7..8...8..4..25..2......6..1......9..8..73..5..1.........5...6..7..92..3..6......7..8...8..4..25..2......6..1..4...9..8..73..5..1...4..3..5......7..9......6...1..7......8..4..2`
ravel

Posts: 998
Joined: 21 February 2006

Thanks ravel, and please tell me where the gsf's solver?
Eioru

Posts: 182
Joined: 16 August 2006

I copied it here (downloads at the end of the page). It is a command line program and i never used it under windows.

Option to calculate the minimals is -m,
options for these ratings are
-B -f'%f:%j %16@%(V)x %2(P)x %5r' -q hardest

E.g. i copied your puzzle to a file xx.dat and ran
./sudoku -m < xx.dat > xy.dat
to get the minimal puzzles, then
./sudoku -c2 -B -f'%f:%j %16@%(V)x %2(P)x %5r' -q hardest <xy.dat > xr.dat
to get the ratings.

Take the name of the exe instead of ./sudoku, -o instead of >, and probably leave out < under windows.

I am sure there are better ways to do it.
See the man page or ask gsf

The 3 puzzles needed 4,3 and 4 steps.
ravel

Posts: 998
Joined: 21 February 2006

New problem
This is 18-clue without any empty units.
Finding this puzzle exist.
Code: Select all
`....O....O.O...O.O....O.....O.....O....O.O....O.....O.....O....O.O...O.O....O....`
Eioru

Posts: 182
Joined: 16 August 2006