Blocks world tile puzzle - AI Search Methods

This puzzle consists of three tiles "A", "B" and "C" and the agent which can only move up, down, left and right. The agent's goal is to place the tiles in a specific pattern.

Example Agent moves

The problem to solve

This is by the default the problem used to test the four search methods. The final position of the agent does not matter.

Project Structure (Java)

The way I have structured my code is described in the UML diagram down below.

Dependencies

• Encoding UTF-8 supported on your terminal, the output is displayed using box-drawings characters.
• Java installed on your machine.

Executing one of the four algorithms

• compile main class

> javac Main.java

• run Main class with one argument defining the strategy ("BFS", "IDS", "DFS" or "AStar"). For example,

> java Main "IDS"

A* on operation 🚀

Issues

When running BFS you might get an error like this:

java.lang.OutOfMemoryError: Java heap space

To overcome this issue increase the Java heap memory size by at least 10GB passing these parameters:

> java -Xms10000m -Xmx15000m  Main "BFS"

Author

Alked Ejupi Copyright (2019). All rights reserved.

Reference

Peter Norvig Stuart Russel. Artificial Intelligence - A modern approach (3rd edition). Prentice Hall Press Upper Saddle River, NJ, USA, 2009.