Skip to content
#

mrv-heuristic

Here are 47 public repositories matching this topic...

This project is a sudoku-solver implement by Constraint satisfaction problem. We add the colour option to our sudoku problem as if the number of a place is bigger than other neighbours, the colour of that place must be higher in a given colour's priority. We use the Constraint satisfaction problem(CSP), as we said before, in additional apply deg…

  • Updated Feb 10, 2021
  • Python

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

Improve this page

Add a description, image, and links to the mrv-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 mrv-heuristic topic, visit your repo's landing page and select "manage topics."

Learn more