Hlavolam Water sort

Abstract

This bachelor thesis focuses on solving the Water Sort puzzle. The aim of the thesis is to analyze this puzzle from the perspective of discrete mathematics. The analysis of the state graph together with the combinatorial rules allowed a formal description of the puzzle and its solution, thus achieving the goal set in the assignment. The result is a set of propositions characterizing the structure of the puzzle and the conditions for its solvability. The work shows that for most puzzles it is possible to find solutions if the moves are chosen wisely. The findings can be applied to improve the efficiency of algorithms solving this type of conundrum or in the analysis of puzzles based on overflow.

Description

Subject(s)

water sort puzzle, overflow puzzle, discrete mathematics, graph theory, combinatorics, state graph

Citation