Search Results for "sudoku solver in c++"

OSQP uses a specialized ADMM-based first-order method with custom sparse linear algebra routines that exploit structure in problem data. The algorithm is absolutely division-free after the setup and it requires no assumptions on problem data (the problem only needs to be convex). It just works. OSQP has an easy interface to generate customized embeddable C code with no memory manager required. OSQP supports many interfaces including C/C++, Fortran, Matlab, Python, R, Julia, Rust.

GNU Prolog is a free implementation (under GPL) of the logic programming language PROLOG. It can compile to native machine code which is extremely fast in execution. Another feature is the included constraint solver.

dlvhex is a prototype solver for HEX-programs which integrate Answer-Set Programs with higher-order reasoning and external computation sources. It comes with a full-fledged plug-in framework for rapid extension development.

EasyCP is a modern, user-friendly C++ library that lets you use constraint programming in a very natural way, taking advantage of its expressive power. Just model and let the CSP (Constraint Satisfaction Problem) solver do the job !

A prototype solver for computing partial equilibria of Distributed Nonmonotonic Multi-Context Systems (MCS).

This is an effort to create the best yet simple sudoku solver.

Now with GUI! jiSudokuSolver is really a Java Sudoku master. It solves any puzzle, good or bad, even an empty one, usually in an instant, and it shows you how, every step. It also lets you play, generate, fix, test, reduce... just run startGUI.bat.

A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.

KUBOKU is a real 3D version of the Sudoku game for Linux and for Windows. It comes with a nice 2D or 3D graphical interface, a real-time game generator, different difficulties, a detailed help file and a high score. English and French versions !

The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.

A modular SAT solver based on Minisat. The modules are described in XML-files, which are processed by a perl script; thus generating n-solvers.

Classic game solved with MinMax algorithm (full solution tree) and simple Heuristics. Specially for learning and teaching computer AI

The horn++ library allows you to solve logical expressions in C++. The expressions must be transformed to horn clauses, which can be written as C++ expressions. The solver uses backtracking to find a solution for the logical problem.

A Constraint Programming engine with many examples (planning, sudoku solver...)

Csolve is a constraint solver compiler. It compiles a set of constraints into an arc-consistency algorithm. Generated output is in the C language and can be linked with existing code. Csolve also contains libraries for standard instantiation method

Tool for comparing an answer set solver against another (reference) solver.