We are given two 3-digit numbers called S (start) and G (goal), and also a set of 3-digit numbers called forbidden. To solve the puzzle, we want to get from S to G in the fewest possible moves. A move consists of transforming a number into anothe