This is a simple SAT solver with a string based interface, built for easy access. It tries to parse many different commenly used syntaxes into a AST and then solves the problem, returning one or all solutions. You may also only use the AST and provide a s

Google OR-Tools CP-SAT solver bindings for Node.js / TypeScript.

picosat SAT solver

CaDiCaL SAT solver compiled to WebAssembly, for Node.js and browsers

SAT Solver npm package written in C++

A simple JavaScript SAT solver

simple backtracking sat solver

A Sat-Solver algorithm to calculate formwork plan.

Saguaro is a SAT solver

General satisfiability solver for logic problems

RVF self-learning temporal solver — Thompson Sampling, PolicyKernel, ReasoningBank

Reusable building blocks for iterative solvers, multi-stage solver pipelines, and React-based solver debugging UIs.

Easy to use, JSON oriented Linear Programming and Mixed Int. Programming Solver

This project provides high-level and low-level TypeScript bindings for the [Z3 theorem prover](https://github.com/Z3Prover/z3). It is available on npm as [z3-solver](https://www.npmjs.com/package/z3-solver).

Solves PCB copper pour regions from Circuit JSON or from a small geometry input format, returning `pcb_copper_pour`-ready B-Rep shapes.

An MIT-licensed PCB autorouter made for usage with [tscircuit](https://github.com/tscircuit/tscircuit). This is the builtin autorouter.

TypeScript definitions for http-errors

TypeScript definitions for yauzl

TypeScript definitions for mdx

TypeScript definitions for lodash