Mercurial > repos > other > SevenLanguagesInSevenWeeks

comparison 3-Prolog/readme.txt @ 69:05871e7ac124

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add notes on how to invoke the Sudoku code
author IBBoard <dev@ibboard.co.uk>
date Sat, 07 Oct 2017 16:50:14 +0100
parents 90c4b7f28690
children
comparison
equal deleted inserted replaced
68:b4f994693f7b 69:05871e7ac124
20 20
21 then Prolog will check both "definitions" of the rule. 21 then Prolog will check both "definitions" of the rule.
22 22
23 (Note: putting the recursive "ancestor/2" call at the end is called "tail recursion" and the language can optimise it to 23 (Note: putting the recursive "ancestor/2" call at the end is called "tail recursion" and the language can optimise it to
24 reduce call stack exhaustion issues) 24 reduce call stack exhaustion issues)
25
26 For the sudoku code, example invocations are:
27
28 % 2×2 grid, from the book - solved correctly
29 sudoku([_,_,2,3, _,_,_,_, _,_,_,_, 3,4,_,_], 2,2, Solution).
30
31 % 2x3 grid (size suggested in the exercise)
32 % For some reason, this one can't be perfectly solved unless certain extra values are added
33 sudoku([_,6,_,_,_,_, 1,_,3,_,5,_, _,_,1,_,_,2, 6,_,_,4,_,_, _,5,_,3,_,1, _,_,_,_,2,_], 3, 2, Solution).
34
35 % Normal 3x3 grid
36 sudoku([_,8,3,_,4,_,_,1,7, 6,_,_,7,_,_,_,4,_, _,_,_,8,_,_,9,_,_, 8,_,5,3,7,_,_,_,_, _,_,_,1,_,9,_,_,_, _,_,_,_,8,5,3,_,9, _,_,6,_,_,8,_,_,_, _,2,_,_,_,1,_,_,3, 3,4,_,_,2,_,5,9,_ ], 3, 3, Solution).