Greedy A. EIght is using Greedy Approach algorithm to find a solution to an eight puzzle. Greedy Approach is an algorithm that will find the current state local max and disregard the future states. Eight puzzle is a 3 by 3 squares with one blank square. The objective of this puzzle is to keep moving the blank square to reach the goal state.