blocks-world

My solution to BW20019 assignment for Artificial Intelligence subject in UoM.

Lazy problem description

We have an initial state, which it looks like this...
 _
|A|  _
|B| |C|
======== <-- table

We have a goal state, which it looks like this...
 _
|B|
|C|
|A|
======== <-- table
Now to reach from initial state to goal state, we need to perform some steps. The algorithms do that their own way.
So, a solution would be:

1. Move A on table
2. Move C on A
3. Move B on C

Usage

python3 solution.py <algorithm> <problem_file_name.pddl> [solution_file_name]

Available algorithms

• breadth (Breadth First Search)
• depth (Depth First Search)
• best (Best First Search)
• astar (A* Search)

Test all the problems

If you are using Linux, use chmod +x test.sh to give the script execution permissions, then navigate to it's location via terminal and run it using ./tests.sh to test all the problems under problems folder. For more problems in your life, see this.