» ASP Competition | |
|
Labyrinth Optimization VersionProblem description This problem modifies its corresponding decision problem by minimizing the number of instances of "push"
in a solution.
For a labyrinth of size NxN and a maximum number m of steps,
the objective function to minimize is as follows: Input formatSee corresponding decision problem. Output formatSee corresponding decision problem. Author: Martin Gebser |