홈 › Papers

Towards a Model of Puzznic

We report on progress in modelling and solving Puzznic, a video game requiring the player to plan sequences of moves to clear a grid by matching blocks. We focus here on levels with no moving blocks. We compare a planning approach and three constraint programming approaches on a small set of benchmark instances. The planning approach is at present superior to the constraint programming approaches, but we outline proposals for improving the constraint models.

Code (0)

등록된 구현이 없습니다.

Tasks

Methods 이 논문이 사용한 방법론