Search Results for author:
Found 7 papers, 2 papers with code
On Grid Graph Reachability and Puzzle Games
Many puzzle video games, like Sokoban, involve moving some agent in a maze.
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.
A Good Snowman is Hard to Plan
In this work we face a challenging puzzle video game: A Good Snowman is Hard to Build.
Challenges in Modelling and Solving Plotting with PDDL
We study a planning problem based on Plotting, a tile-matching puzzle video game published by Taito in 1989.
A Preliminary Case Study of Planning With Complex Transitions: Plotting
Plotting is an example of a planning problem: given a model of the environment, a planning problem asks us to find a sequence of actions that can lead from an initial state of the environment to a given goal state while respecting some constraints.
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints
When solving a combinatorial problem using propositional satisfiability (SAT), the encoding of the problem is of vital importance.
Nominal Unification and Matching of Higher Order Expressions with Recursive Let
We also provide a nominal unification algorithm for higher-order expressions with recursive let and atom-variables, where we show that it also runs in nondeterministic polynomial time.
