Skip to content
COMP316 - Pathfinding: An implementation of maze pathfinding in Clojure
Clojure
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
doc
src/assignment2
test/assignment2
.gitignore
CHANGELOG.md
LICENSE
README.md
REPORT.md
SOME TEST CASES.txt
map-316
map-empty
map-empty2
map-impossible
map-impossible2
map-impossible3
map-large
map-med
map-small
project.clj

README.md

COMP316 Assignment 2


How to run the functions

  1. Open the REPL
  2. Use one of the following commands,
  • For Depth First Search: (dfs :scenario <scenario as keyword> :print-states <boolean>)
  • For A*: (dfs :scenario <scenario as keyword> :print-states <boolean>)
  1. The output will be in the format below:
; If :print-states was true, include...
Expanded States:
<List of reduced-info states in the following format>
{:x <column> :y <row> :heur <heuristic value, only included in A*>}
; The following is always included
Total States Evaluated: <# of states expanded>
Number of Steps in Path: <# of states that existed in the path>
Path Length: <Length of path>
History
<Print out of the map with '*' marking where the robot traveled>
true
  1. If it is impossible for the robot to reach the goal (i.e. the open list is empty), the output will look like:
Expanded States:
; If :print-states was true, include...
Expanded States:
<List of reduced-info states in the following format>
{:x <column> :y <row> :heur <heuristic value, only included in A*>}
; The following is always included
Total States Evaluated: <# of states expanded>
Unable to find a path
false
You can’t perform that action at this time.