Skip to content
#

minimum-remaining-values

Star

Here are 3 public repositories matching this topic...

Language: Java
Filter by language
All 9 Python 5 Java 3 Rust 1

adityagupta1089 / Sudoku-Solver-by-CSP-and-Minisat

Star 2

Sudoku Solver by constraint satisfaction problem (CSP) using heuristics - Minimum Remaining Value (MRV), Least Common Value (LCV), Maintainin Arc Consistency (MAC). Secondly, by converting to Satisfiability Problem (SAT) and using a sat solver (miniSAT).

constraint-satisfaction-problem sudoku-solver sudoku minisat sat minimum-remaining-values least-common-values maintaining-arc-consistency
  • Updated May 11, 2017
  • Java

TheShanachie / sudoku-solver

Star 0

A command-line sudoku solver implemented in Java that uses constraint satisfaction techniques to solve puzzles of varying difficulty. It supports input via configuration files or direct command-line arguments, and can apply optimizations like Minimum Remaining Values (MRV) and Least Constraining Values (LCV) to improve performance.

java maven makefile constraint-satisfaction-problem junit5 least-constraining-value minimum-remaining-values
  • Updated Aug 15, 2025
  • Java

Improve this page

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

Learn more