 In puzzles where previous actions do not influence the solution, you need to only evaluate this position once to get a solution for both paths.To avoid evaluating the same position more than once (and thus wasting computation cycles), programs written to solve these kinds of puzzles use transposition tables.A transposition is a puzzle state that can be reached by different paths but has the same solution.