This repository contains some documents related to the course "Planning and Heuristic Search", specifically small (non-optimized) versions of popular graph-search algorithms. Most of the code base will be written in Python.
This repository has been archived by the owner on Jun 23, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
theovier/UPB-planning-and-heuristic-search
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Non-optimized implementations of algorithms discussed in the course "planning and heuristic search" at Paderborn University (WS 2018/19).
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published