Definition: A backtracker is a method of computing, typically used in computer science and programming, to find the minimum number of steps required to reach a given point from another given point. The algorithm works by repeatedly subtracting the smaller value from the larger one until it finds the desired point or reaches the end of the path. For example, consider the following graph: ``` A / \ B C | | D E / \ / F