A CSP approach to solve magnet puzzle problem
-
Updated
Jan 26, 2022 - Java
A CSP approach to solve magnet puzzle problem
This is a homework about Formulating a game called "Magnet Puzzle" into CSP, then using Backtracking, Forward Checking to solve it. Various heuristics such as MRV, LCV, Arc consistency (AC3) is used to improve the searching performance. This homework is a part of many projects in a Fundamentals to AI course @ FUM.
Implementation of CSP heuristics and various algorithms for solving magnet puzzle
Add a description, image, and links to the magnet-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the magnet-puzzle topic, visit your repo's landing page and select "manage topics."