HaskellStateSpaceSearch

HaskellStateSpaceSearch is a library containing state space search algorithms for Haskell. It was initially developed as part of an assignment for the subject "Delarative Programming" at the University of Seville.

The remaining part is HaskellGraph, a library used to work with graph data structures.

Contents

• StateSpaceSearch.Backtracking: Implementation of the well-known backtracking algoritm.
• StateSpaceSearch.DynamicProgramming: Implementation of the dynamic programming algorithm, both for problems that produce many subproblems in each step and a simplified version for reduction problems.
• StateSpaceSearch.Greedy: Implementation of a greedy algorithm.

Note: testsStateSpaceSearch.hs contains usage examples of all the modules. It also analyzes the problems that can be adressed with these algorithms.

Usage

You may import the modules you need by using the following lines:

import StateSpaceSearch.Backtracking
import StateSpaceSearch.DynamicProgramming
import StateSpaceSearch.Greedy

Note: reconstructSolState function can be found in both the DynamicProgramming and the Greedy submodules. If you want to import both you will need to hide it from in one of them as follows:

import StateSpaceSearch.Greedy hiding (reconstructSolState)