Assignment in course TDT4136 Introduction to AI.
Algorithm for finding shortest path.
Simple board, only non-blocking and blocking cells, and all costs are set to 1. (board-1-*)
Different cell contents with associated cost. (board-2-*)
-
Notifications
You must be signed in to change notification settings - Fork 0
endwaa/AStar
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Python implementation of the A* algorithm.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published