The N-puzzle is a well known problem. In this report we only analyzed the 8-puzzle. To solve the puzzle we used several algorithms namely a*, greedy, strips, breadth-first, depth-first. For the algorithms a* and greedy we used two heuristics: Manhattan distance and misplaced tiles. We compared the different algorithms and measured time, steps and memory they used. We implemented everything with python. We found out that the greedy algorithms were (by far) the fastest and a* was the only optimal algorithm.