0h-h1 Solver

0h-h1 solver. Special assignment for SIA course at ITBA. It uses the General Problem Solver as the engine.

Building and running

This project uses maven.

mvn clean package
java -jar target/uber-tp1-1.0-SNAPSHOT.jar -s [STRATEGY] -b [BOARD_PATH] -h [HEURISTIC_NUMBER] -c [CUT_CONDITION]

For example:

java -jar target/uber-tp1-1.0-SNAPSHOT.jar -s ASTAR -b ./boards/board2.txt -h 2 -c 5

Where the keys are:

Key	Description
-s	Search Strategy
-b	Board file path
-h	Heuristic number (codes can be found in the next section)
-c	Cut condition for IDDFS

Heuristics

The following heuristics were developed

Heuristic	Code
0	Trivial
4	Semi Sure Heuristic

Search Strategies

The following search strategies are available:

• DFS
• BFS
• IDDFS
• GREEDY
• ASTAR

Credits

Group 3

• Soncini, Lucas (52066)
• Marzoratti, Luis (54449)
• Fraga, Matías (53214)
• De Lucca, Tomás (52051)