Search Results for "solver"

poetiq-arc-agi-solver is the open-source codebase from Poetiq that replicates their record-breaking submission to the challenging benchmark suite ARC-AGI (both ARC-AGI-1 and ARC-AGI-2). The project demonstrates a system that orchestrates large language models (LLMs) — like those from major providers — with carefully engineered prompting, reasoning workflows, and dynamic strategies, to tackle the abstract, logic-heavy problems in ARC-AGI.

Diffrax is a numerical differential equation solving library built for the JAX ecosystem, with a strong focus on composability, differentiability, and high-performance scientific computing. The project provides tools for solving ordinary differential equations, stochastic differential equations, controlled differential equations, and related systems in a way that fits naturally into modern machine learning and differentiable programming workflows. Because it is written to work closely with...

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).

The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques.

...It’s designed to let you define “evals” (evaluation tasks) in a structured way and run them against different models or agents, with the ability to score, compare, and analyze results. The framework supports templated YAML eval definitions, solver-based evaluations, custom metrics, and composition of multi-step evaluations. It includes utilities and APIs to plug in completion functions, manage prompts, wrap retries or error handling, and register new evaluation types. It also maintains a growing registry of standard benchmarks or “evals” that users can reuse (for example, tasks measuring reasoning, factual accuracy, or chain-of-thought capabilities). ...

...The project introduces a specialized numerical solver designed to approximate the diffusion process using a small number of high-order integration steps. By reformulating the sampling problem as the solution of a diffusion-related ordinary differential equation, the solver can produce high-quality samples much more efficiently. This approach significantly reduces the computational cost required to generate images while maintaining strong generation quality.

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 !

CSPFJ or CSP4J is an simple, hopefully fast CSP solver API written in Java featuring state-of-art search algorithms

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.

Moved to github: https://github.com/claycephus/MineSweeperWhiz Artificial intelligence solver as well as a human-playable mode for Mine Sweeper.

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.

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...)

VKAS uses genetic programming methods to find out the relationship among a set of independent and dependent variable. It is a problem solver software which uses evolutionary computing methods. When vkas is run, it creates a population of chromosomes at random. This population is then genetically modified and next population is generated. Each population is subjected to fitness calculation and if a suitable answer chromosome is found then vkas stops and the answer is printed. ...

The DragonBreath Engine is a constraint solver based on local search. It features real-time computation, handling of dynamics, structural constraint satisfaction, and an easy way to include domain-specific knowledge.