A simulator for solving the Multi-Agent Pathfinding problem that involves a hybrid algorithm with a SAT solver and independence detection with A* search.
More specifics about the problem background, problem description, theory, implementation, and results can be found here: https://www.dropbox.com/s/tckes21yxcogsn2/written_final_report.pdf?dl=0
Completed as a part of COS IW 08: Practical Solutions to Intractable Problems at Princeton University during the Spring of 2017. Advised by Professor Zak Kincaid.