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 labyrinth.enc.asp

Name	labyrinth.enc.asp
Class Tree	[Root]    Puzzles (51)    Grid (17)    Labyrinth (4)    3D ASP Competition (1)
Submitter	Barbara Nardi
Author	Martin Gebser
Description
Created	2012-04-11 15:52
Modified	2012-04-11 18:33
Languages	ASP-Core
Language Features	Disjunction
Compatible Instance Classes
Input Predicates
Output Predicates
Encoding Parameter
Standalone	No
Tags
Attributes
Content	dir(e). dir(w). dir(n). dir(s). inverse(e,w). inverse(w,e). inverse(n,s). inverse(s,n). row(X) :- field(X,Y). col(Y) :- field(X,Y). num_rows(X) :- row(X), not row(XX), XX = X+1. num_cols(Y) :- col(Y), not col(YY), YY = Y+1. goal(X,Y,0) :- goal_on(X,Y). reach(X,Y,0) :- init_on(X,Y). conn(X,Y,D,0) :- connect(X,Y,D). step(S) :- max_steps(S), 0 < S. step(T) :- step(S), T = S-1, 1 < S. %% Direct neighbors dneighbor(n,X,Y,XX,Y) :- field(X,Y), field(XX,Y), XX = X+1. dneighbor(s,X,Y,XX,Y) :- field(X,Y), field(XX,Y), XX = X-1. dneighbor(e,X,Y,X,YY) :- field(X,Y), field(X,YY), YY = Y+1. dneighbor(w,X,Y,X,YY) :- field(X,Y), field(X,YY), YY = Y-1. %% All neighboring fields neighbor(D,X,Y,XX,YY) :- dneighbor(D,X,Y,XX,YY). neighbor(n,X,Y, 1, Y) :- field(X,Y), num_rows(X). neighbor(s,1,Y, X, Y) :- field(X,Y), num_rows(X). neighbor(e,X,Y, X, 1) :- field(X,Y), num_cols(Y). neighbor(w,X,1, X, Y) :- field(X,Y), num_cols(Y). %% Select a row or column to push neg_goal(T) :- goal(X,Y,T), not reach(X,Y,T). rrpush(T) :- step(T), neg_goal(S), S = T-1, not ccpush(T). ccpush(T) :- step(T), neg_goal(S), S = T-1, not rrpush(T). orpush(X,T) :- row(X), row(XX), rpush(XX,T), X != XX. ocpush(Y,T) :- col(Y), col(YY), cpush(YY,T), Y != YY. rpush(X,T) :- row(X), rrpush(T), not orpush(X,T). cpush(Y,T) :- col(Y), ccpush(T), not ocpush(Y,T). push(X,e,T) :- rpush(X,T), not push(X,w,T). push(X,w,T) :- rpush(X,T), not push(X,e,T). push(Y,n,T) :- cpush(Y,T), not push(Y,s,T). push(Y,s,T) :- cpush(Y,T), not push(Y,n,T). %% Determine new position of a (pushed) field shift(XX,YY,X,Y,T) :- neighbor(e,XX,YY,X,Y), push(XX,e,T), step(T). shift(XX,YY,X,Y,T) :- neighbor(w,XX,YY,X,Y), push(XX,w,T), step(T). shift(XX,YY,X,Y,T) :- neighbor(n,XX,YY,X,Y), push(YY,n,T), step(T). shift(XX,YY,X,Y,T) :- neighbor(s,XX,YY,X,Y), push(YY,s,T), step(T). shift( X, Y,X,Y,T) :- field(X,Y), not push(X,e,T), not push(X,w,T), not push(Y,n,T), not push(Y,s,T), step(T). %% Move connections around conn(X,Y,D,T) :- conn(XX,YY,D,S), S = T-1, dir(D), shift(XX,YY,X,Y,T), step(T). %% Location of goal after pushing goal(X,Y,T) :- goal(XX,YY,S), S = T-1, shift(XX,YY,X,Y,T), step(T). %% Locations reachable from new position reach(X,Y,T) :- reach(XX,YY,S), S = T-1, shift(XX,YY,X,Y,T), step(T). reach(X,Y,T) :- reach(XX,YY,T), dneighbor(D,XX,YY,X,Y), conn(XX,YY,D,T), conn(X,Y,E,T), inverse(D,E), step(T). %% Goal must be reached :- neg_goal(S), max_steps(S). %% Project output % #hide. % #show push(Z,D,T).