Skip to content
#

lcv-heuristic

Here are 14 public repositories matching this topic...

This is a practice for AI Search Algorithm. Grocery Bagging is a Constraint Satisfaction Problem (CSP). I used Backtracking search algorithm (Depth-First-Search) along with arc-consistency, Most Restrictive Value (MRV) and Least Constraining Value (LCV) heuristics for prioritizing and pruning to solve the problem as efficiently as possible.

  • Updated Oct 27, 2021
  • Java

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.

  • Updated Jul 13, 2022
  • Java

Improve this page

Add a description, image, and links to the lcv-heuristic topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the lcv-heuristic topic, visit your repo's landing page and select "manage topics."

Learn more