an implementation of Branch and Bound (with dynamic programming), A* Search and Stochastic Hill Local search done for a university assignment in Artificial Machine Intelligence.
Use Branch and Bound Dynamic Programming search on a node file: dyn-branch-search
Use A* search on a node file + heuristic file: astar-search
Use Stochastic Hill Local search on a 3D Map file: stochastic-hill
Test files are included under localtest and inftest.
Copyright (C) 2014 Jason Giancono (email@example.com)
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.