Lib/backtracking

Note: this documentation is not meant to replace the eiffeldoc pages.

The backtracking cluster

This cluster has at least three ideas: backtracking, backtracking and backtracking.

What is backtracking? Imagine that you are a mouse in a maze and that you have to find food. Each time that you enter a dead-end, you have to backtrack until the previous crossing and continue with the next issue or if all the issues were explored, to backtrack again and again.

Backtracking is of general purpose for searches. There are many applications for the backtracking algorithm and many algorithms can be rewritten as backtracking problems.

The backtracking cluster is easy to use. It allows you to quickly create a solution to your complex problem, a solution that can be improved later on, if needed, by specialisation.

The main class to look at is BACKTRACKING.