26th International Conference on Inductive Logic Programming

4th - 6th September 2016, London


2016

L

P






Competition


Time:

Your agent can usually move to any adjacent cell; however, with a probability of 0.1 at each timestep, your agent will self destruct, meaning that the only available move is to return to the starting point.

      Download Task File: PrologASP

Output


VALID(0,0.08760237482646621165)
VALID(1,0.08760237482646621165)
VALID(2,0.08760237482646621165)
VALID(3,0.08760237482646621165)
VALID(4,0.08760237482646621165)
VALID(5,0.08760237482646621165)
VALID(6,0.08760237482646621165)
VALID(7,0.08760237482646621165)
VALID(8,0.08760237482646621165)
VALID(10,0.08760237482646621165)
VALID(11,0.08760237482646621165)
VALID(12,0.08760237482646621165)
VALID(14,0.08760237482646621165)
VALID(9,0.91519376744418368119)
VALID(13,0.91519376744418368119)
VALID(15,0.91519376744418368119)
VALID(16,0.91519376744418368119)
VALID(17,0.91519376744418368119)
VALID(18,0.91519376744418368119)
VALID(19,0.91519376744418368119)