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 sokoban_optimization.gringo

Name	sokoban_optimization.gringo
Class Tree	[Root]    Puzzles (51)    Grid (17)    Sokoban (4)      3D ASP Competition (1)
Submitter	Martin Gebser
Author	Martin Gebser and Roland Kaminski
Description	A Gringo encoding of the optimization version of Sokoban.
Created	2009-03-21 14:43
Modified	2009-05-09 14:44
Languages	Gringo 2.0.2
Language Features	Cardinality constraints Optimization Choice rules
Compatible Instance Classes	Sokoban
Input Predicates	box/1 next/2 right/2 sokoban/1 solution/1 step/1 top/2
Output Predicates	push/4
Encoding Parameter
Standalone	No
Tags	ASP Contest 09 (Martin Gebser)
Attributes
Content	% possible directions direction(up;down;right;left). loc(L1;L2) :- top(L1,L2). loc(L1;L2) :- right(L1,L2). adj(up, L1,L2) :- top(L1,L2). adj(down, L1,L2) :- top(L2,L1). adj(right,L1,L2) :- right(L1,L2). adj(left, L1,L2) :- right(L2,L1). first(S1) :- step(S1), not next(S2,S1) : step(S2). last(S1) :- step(S1), not next(S1,S2) : step(S2). sokoban(L,S) :- sokoban(L), first(S). box(L,S) :- box(L), first(S). % reachable places at timestep k route(L, S) :- sokoban(L,S), not goal(S). route(L2,S) :- route(L1,S), step(S), adj(D,L1,L2), not box(L2,S), not last(S). % select a place to push from (must be reachable and have a box to push) 1 { push_from(L,D,S) : loc(L) : direction(D) } 1 :- step(S), not goal(S). :- push_from(L,D,S), not route(L,S). :- push_from(L1,D,S), adj(D,L1,L2), not box(L2,S). :- push_from(L1,D,S), { adj(D,L1,L2) : loc(L2) } 0. % push the box one or more fields into direction D (but at least one) push(L2,D,S) :- push_from(L1,D,S), adj(D,L1,L2). { push(L2,D,S) } :- push(L1,D,S), adj(D,L1,L2), step(S), not last(S). :- push(L1,D,S), adj(D,L1,L2), box(L2,S). :- push(L1,D,S), { adj(D,L1,L2) : loc(L2) } 0. % the last push is the final location push_to(L1,D,S) :- push(L1,D,S), adj(D,L1,L2), not push(L2,D,S). % the sokoban stands behind the pushed box sokoban(L,S2) :- push_to(L,D,S1), next(S1,S2). % put the pushed box at the new location box(L2,S2) :- push_to(L1,D,S1), adj(D,L1,L2), next(S1,S2). % all other boxes stay where they are box(L2,S2) :- box(L2,S1), loc(L2), next(S1,S2), not push_from(L1,D,S1) : adj(D,L1,L2). % forbid redundant moves :- push_to(L,D,S1), push_from(L,D,S2), next(S1,S2). % the goal goal(S) :- box(L,S) : solution(L), step(S). goal(S2) :- goal(S1), next(S1,S2). :- last(S), not goal(S). % the output format makes grounding slow % push(L2,D,L4,S) :- push_from(L1,D,S), push_to(L3,D,S), adj(D,L1,L2), adj(D,L3,L4). % I hope this reduces the blow-up a bit same(D,L2,L2) :- loc(L2), direction(D), { adj(D,L1,L2) : loc(L1) } 0. same(D,L1,L3) :- loc(L1), same(D,L1,L2), adj(D,L2,L3). push(L2,D,L4,S) :- push_from(L1,D,S), push_to(L3,D,S), adj(D,L1,L2), adj(D,L3,L4), same(D,L,L1;L3). #maximize { goal(S) : step(S) }. #hide. #show push(L1,D,L2,S).