Skip to content

Latest commit

 

History

History
7 lines (6 loc) · 306 Bytes

README.md

File metadata and controls

7 lines (6 loc) · 306 Bytes

search

Search algorithms in Haskell

Going through an AI textbook to learn some basic AI principles. Implements a few different search algorithms, both uninformed and informed. This includes breadth-first search, depth-first search (and friends), uniform-cost search, greedy (best-first) search, and a*.