A summary of my modifications/improvements over the original code can be found at the top of Minlex9.c
To compile the demo program:
- gcc -O3 -o Demo.exe Demo.c Minlex9.c
The demo program shows how to call the library functions, and should produce the following output (example by JPF):
- Code: Select all
.3.89......5.....4.17....5.9......8.....76....5.12............7...5.38.2..1.6...5 # Puzzle
432895176895617324617432958976354281128976543354128769543281697769543812281769435 # Solution
123456789456789123789123456231564897564897231897231564315672948672948315948315672 # Minlex grid
.....67..45.....2..89......2.156.......8......9.2....4.....2.4867.....1....3....2 # first CP
.......89..67.........2.45.2....4.9.56....2.18........3....2.....2.48.......1.67. # minlex CP
.....67..45.....2..89......2.156.......8......9.2....4.....2.4867.....1....3....2 # CP 1
..3.5.7........1..78....4.6.31......5.4..7......2...6.....7.9..6.2..8.......15.7. # CP 2
1........4.678....7....3.5....5.4..7.6....2......31......6.2..8.7.....159......7. # CP 3
...4.678..5.7....3...1.....2...6...........31..7...5.4.15.7.....7.9.......8...6.2 # CP 4
.2.45........89...7.......6......8....4.9.2.....2.156..1.67......2...3...48.....2 # CP 5
.......89..67.........2.45.2....4.9.56....2.18........3....2.....2.48.......1.67. # CP 6
