Overview

Tree Search Implementations

How can we use Tree Search Algorithms to figure out Tetris?

There are many great Generalized Tree Search Algorithms that can be used to solve this problem!

In this application we'll implement:

• Depth First Search
• Breadth First Search
• Depth First Search
• Recursive DLS
• Iterative Deepening
• Simulated Annealing
• Hill Climbing
• A*
• Greedy Best First Search

GUI Screenshot

You can plugin how many of each shape you want to put in the board, select an algorithm and the app will do search to find a solution. At the end, if prints the location of the pieces for the solution.

Performance Trends

Running

To run the application just clone or download the zip and run this in the command line:

mvn install exec:java