On correctness of an n queens program

09/16/2019

∙

by   Włodzimierz Drabent, et al.

∙

0

∙

share

Thom Frühwirth presented a short, elegant and efficient Prolog program for the n queens problem. However the program may be seen as rather tricky and one may be not convinced about its correctness. This paper explains the program in a declarative way, and provides a proof of its correctness and completeness.