# Kiwi - A Minimalist CP Solver

**Authors:** Renaud Hartert

arXiv: 1705.00047 · 2017-05-03

## TL;DR

Kiwi is a minimalist, educational constraint programming solver that emphasizes core mechanisms, modular variable handling, and extendability to aid learning and development of custom solvers.

## Contribution

It introduces a simple, extendable CP solver architecture focusing on core mechanisms, suitable for educational purposes and experimentation.

## Key findings

- Provides a basic architecture for understanding CP solvers
- Highlights the use of a generic trailing state restoration mechanism
- Facilitates development and testing of innovative ideas in constraint solving

## Abstract

Kiwi is a minimalist and extendable Constraint Programming (CP) solver specifically designed for education. The particularities of Kiwi stand in its generic trailing state restoration mechanism and its modulable use of variables. By developing Kiwi, the author does not aim to provide an alternative to full featured constraint solvers but rather to provide readers with a basic architecture that will (hopefully) help them to understand the core mechanisms hidden under the hood of constraint solvers, to develop their own extended constraint solver, or to test innovative ideas.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1705.00047/full.md

## Figures

6 figures with captions in the complete paper: https://tomesphere.com/paper/1705.00047/full.md

## References

17 references — full list in the complete paper: https://tomesphere.com/paper/1705.00047/full.md

---
Source: https://tomesphere.com/paper/1705.00047