Implementing greater-than sudoku solver in Prolog

Question

How to implement greater-than sudoku solver in Prolog using clpfd? I have trouble figuring out how to add those greater-than constraints to regular sudoku solver.

Btw, i've seen the photo on the link and i've seen no pattern. So i think you had to add each constraint by hand — damianodamiano, Jan 09 '18 at 21:35

score 1 · Answer 1 · answered Jan 10 '18 at 13:14

1

Simply put every square in a finite domain with the digits 1 to 9 and emit a #< constraint on each edge.

answered Jan 10 '18 at 13:14

river

1,028
6
16

Implementing greater-than sudoku solver in Prolog

1 Answers1