Backtracking
In computer science and mathematics, backtracking is an algorithmic technique used to solve problems recursively by systematically exploring all possible solutions. It works by incrementally building candidates to the solution, and abandoning a candidate ('backtracking') as soon as it determines that the candidate cannot possibly lead to a valid solution.
9 connections Built by Tim Jones