Search Results for "open solver"

YACS (Yet Another Constraint Solver) is a Java library and an object-oriented framework for constraint solvers. It supports propagating and solving of constraint satisfaction problems with finite and infinite domains (discrete values and real intervals).

Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.

DisChoco is a Distributed Constraint Reasoning Solver. Several Distributed Constraint Reasoning algorithms are implemented (like ABT, AFC, Adopt, ...). Users may easily implement and test their algorithms with DisChoco. contact: wahbi[at]users[dot]sourceforge[dot]net

JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance,...

Automatic Solver for Railway-related conflicts

Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.

This is a Su-do-ku game solver and player. It generates a complete Sudoku.

This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.