» ASP Competition | |
|
15-Puzzle Optimization VersionProblem description This problem modifies its corresponding decision problem by minimizing the number of instances of "move"
in a solution.
For a maximum time stamp m,
the objective function to minimize is as follows: Input formatSee corresponding decision problem. Output formatSee corresponding decision problem. Author: Lengning Liu, Miroslaw Truszczynski, and Martin Gebser |