Please wait ...

Benchmark(s) have been added to cart.

Tag has been added.

• Login
• Links
• FAQs
• Contact

Navigation

• Instance
  • Show Instances
• Problem
  • Show Problems
• Show Tags
• Search
• Cart

Encoding su-doku-clean.lp

Name	su-doku-clean.lp
Class Tree	[Root]    Puzzles (51)    Grid (17)    Su-Doku (3)
Submitter	Martin Gebser
Author	Martin Brain
Description	Martin Brain 09/12/05 A simple, declarative su-doku solver Copyright Martin Brain, 2005 This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
Created	2009-03-30 13:03
Modified	2009-03-13 10:37
Languages	lparse
Language Features	Cardinality constraints Choice rules
Compatible Instance Classes	Su-Doku
Input Predicates	position/1 size/1 state/3 value/1
Output Predicates	state/3 subSize/1
Encoding Parameter
Standalone	No
Tags
Attributes
Content	%% su-doku-clean.lp %% %% Copyright Martin Brain 20/10/06, see COPYING for licence %% mjb@cs.bath.ac.uk %% 15/10/04 %% %% A generic program for solving the Su-Duko puzzle. %% It is a description of a solution rather than how to find one. %% I am told that it can be done without backtracking %% Thus this program should not branch %% The constant sub must be declared in the data - it is the dimensions of one sub square %% In the obvious cases this is 3 subSize(S) :- size(S). % Declared as a literal so the decode script can easily access the size #domain position(X). #domain position(XA). #domain position(XB). #domain position(Y). #domain position(YA). #domain position(YB). #domain value(N). #domain value(NA). #domain value(NB). %% Each square may take any value 1 { state(X,Y,NU) : value(NU) } 1 . %% A number cannot appear twice in a column :- state(XA,Y,N), state(XB,Y,N), XA != XB. %% A twice in a row :- state(X,YA,N), state(X,YB,N), YA != YB. %% Define the concept of sub squares sameSubSquare(NA,NB) :- A = (NA - 1) / S, B = (NB - 1) / S, A = B, size(S). %% Now say there may not be two of the same number in the same subsquare :- state(XA,YA,N), state(XB,YB,N), sameSubSquare(XA,XB), sameSubSquare(YA,YB), XA != XB, YA != YB. #hide . #show state(X,Y,Z). #show subSize(X).