Computers have long been used to quickly solve problems which can be modelled using constraints, like Sudoku, but what if the problem has no solution? An extension to the common functionality of existing constraint…
Exploring the different techniques that can be used to solve sudoku puzzles. Keywords Dissertation,Puzzle Techniques,Constraint Programming, Artificial Intelligence Staff [Ruth Hoffmann]{rh347}
Imagine playing Minesweeper and getting stuck. This system uses smart techniques to assist your gameplay. It combined two solving methods: constraint programming, which helps narrow down where mines might be based on…
The Klondike Solitaire card game, popularised by the Windows Solitaire program, is notable for being surprisingly difficult to win. This research explores how unwinnable deals can be detected and avoided using…
Constraint programming is an important field in computer science for solving constraint problems; problems with a set of rules like Sudoku not allowing the same number in a row or column. These constraint problems…
Unified Planning is a framework sponsored by the EU, intending to make automated planning more accessible. It achieves this by providing access to a variety of different planning techniques in a modular fashion. I have…
The town of St Andrews in north east Fife is famous for three things: the university, its golf course and its pubs. Therefore, the game of Pub Golf has become a popular pastime amongst its university students. The ‘Pub…
Constraint Programming is a method of problem-solving that involves defining variables and their relationships in the form of constraints. It is widely used in various fields such as scheduling, resource allocation,…