The New Sudoku Players' Forum

[Eioru]

Code: Select all

5..2..9..
.6..1..4.
..9..8..7
3..5..1..
.4..3..5.
..6..7..9
2..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.

[ravel]

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..2
5..2......6..1......9..8..73..5..1.........5...6..7..92..3..6......7..8...8..4..2
5..2......6..1..4...9..8..73..5..1...4..3..5......7..9......6...1..7......8..4..2


[Eioru]

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

[ravel]

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.

[Eioru]

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....