29 citations · 64 across the 9 of their papers we have counts for
4 papers · 1 filter
A Good Snowman is Hard to Plan
Miquel Bofill, Cristina Borralleras, Joan Espasa +3
In this work we face a challenging puzzle video game: A Good Snowman is Hard to Build. The objective of the game is to build snowmen by moving and stacking snowballs on a discrete…
Challenges in Modelling and Solving Plotting with PDDL
Joan Espasa, Ian Miguel, Peter Nightingale +2
We study a planning problem based on Plotting, a tile-matching puzzle video game published by Taito in 1989. The objective of this game is to remove a target number of coloured blo…
A Preliminary Case Study of Planning With Complex Transitions: Plotting
Jordi Coll, Joan Espasa, Ian Miguel +1
Plotting is a tile-matching puzzle video game published by Taito in 1989. Its objective is to reduce a given grid of coloured blocks down to a goal number or fewer. This is achieve…
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints
Miquel Bofill, Jordi Coll, Peter Nightingale +3
When solving a combinatorial problem using propositional satisfiability (SAT), the encoding of the problem is of vital importance. We study encodings of Pseudo-Boolean (PB) constra…