Skip to content
/ gbfhs Public

Generalized Breadth-First Search for the n-Puzzle Problem

Notifications You must be signed in to change notification settings

awgu/gbfhs

Repository files navigation

GBFHS Implementation for the n-Puzzle Problem

The repository includes C++ code for running the GBFHS, MMe, and A* algorithms for solving the n-puzzle problem. This is meant for experimentation only and was originally written for a paper dissection in CMU's course 15-780: Graduate Artificial Intelligence.

GBFHS paper: https://www.aaai.org/ocs/index.php/SOCS/SOCS18/paper/view/17965/17097

MM paper: https://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12320

MMe paper: https://aaai.org/ocs/index.php/SOCS/SOCS16/paper/view/13959/13257

About

Generalized Breadth-First Search for the n-Puzzle Problem

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published