Difference between revisions of "Lib/backtracking"
m (6 revisions: initial import from SamrtEiffel Wiki - The Grand SmartEiffel Book) |
|||
| Line 1: | Line 1: | ||
| − | [[Category: |
+ | [[Category:Smarteiffel]] |
'''Note:''' this documentation is not meant to replace the [http://smarteiffel.loria.fr/libraries/index.html eiffeldoc pages]. |
'''Note:''' this documentation is not meant to replace the [http://smarteiffel.loria.fr/libraries/index.html eiffeldoc pages]. |
||
Revision as of 22:15, 4 March 2013
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 fall in the bottom of the way, you have to backtrack until the previous cross and continue with the next issue or if all the issues were explored, to backtrack again and again.
Backtracking is of general purpose for searchs. There are many applications of the algorithm of backtracking and many algorithms can be rewritten as backtracking problems.
The backtracking cluster is easy to use. It allows you to create quickly a solution to your complex problem, a solution that can be improved later, if needed, by specialisation.
The main class too look at is BACKTRACKING.