26th International Conference on Inductive Logic Programming
4th - 6th September 2016, London
2016
L
P
Overview
News
Important Dates
Call for Papers
Competition
Organisation
Program
Invited Speakers
Venue
Registration
Accommodation
Sponsors
Co-located Event
Previous Conferences
Guest
Overview
Scenario
Instructions
Rules
Competition
agent_at((0,0),0). agent_at((1,0),1). agent_at((2,0),2). agent_at((3,0),3). agent_at((4,0),4). agent_at((4,1),5). agent_at((5,1),6). agent_at((6,1),7). agent_at((6,2),8). agent_at((7,2),9). agent_at((8,2),10). agent_at((8,3),11). agent_at((8,4),12). agent_at((9,4),13). agent_at((8,4),14). agent_at((7,4),15). agent_at((7,5),16). agent_at((6,5),17). agent_at((6,6),18). agent_at((5,6),19). agent_at((4,6),20). agent_at((3,6),21). agent_at((2,6),22). agent_at((1,6),23). agent_at((1,7),24). agent_at((0,7),25). agent_at((0,8),26). agent_at((0,9),27).
initial_patrol((4,0)). initial_patrol((2,1)). initial_patrol((1,0)). initial_patrol((2,7)).
Time:
The agent must avoid a patrol guard, who is moving recursively.
Trace 0
Trace 1
Trace 2
Trace 3
Trace 4
Trace 5
Trace 6
Trace 7
Trace 8
Trace 9
Trace 10
Trace 11
Trace 12
Trace 13
Trace 14
Trace 15
Download Task File:
Prolog
,
ASP
Output
INVALID(0) INVALID(1) INVALID(2) INVALID(3) INVALID(4) INVALID(5) INVALID(6) INVALID(7) INVALID(8) INVALID(9) INVALID(10) INVALID(11) INVALID(12) INVALID(13) VALID(14) INVALID(15)