Evaluating Logic Programming in PROLOG for solving Hitori puzzles
A comparison of competing modeling-and-solving paradigms
T.D. Friederich (TU Delft - Electrical Engineering, Mathematics and Computer Science)
A.L.D. Latour – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)
T.J. Coopmans – Graduation committee member (TU Delft - QCD/Coopmans Group)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We evaluate the performance of Logic Programming in PROLOG for solving Hitori puzzles. We analyze the runtime of our model as puzzle size increases, and compare performance to models from
competing modeling-and-solving paradigms. We discuss our model approach, and show that incorporating redundant constraints into our model can reduce average runtime. We discuss PROLOG’s backtracking depth first search and compare it with
techniques used by SAT solvers and CLASP, and briefly discuss options to incorporate some of these search techniques in PROLOG to potentially improve its performance in problems with large search spaces. In the comparison with other paradigms,
Answer Set Programming and Constraint Programming greatly outperformed PROLOG.
help_outline