There are 0 repository under csp-solver topic.
Solves KenKen puzzles, by representing it as a Constraint Satisfaction Problem (CSP)
Tiny framework for solving constraint satisfaction problems (CSP) with discrete and finite domains. This is a Scala-based port of the original Java version. Features Sudoku as an example application.
Python Client library for Qaekwy Operational Research Solver
Constraint Satisfaction Problem (CSP) solver for Sudoku with a graphical interface through python
codes of my IUT course
Classic CSP Algorithms to solve RLFAP
A Genetic Algorithm Framework build for comparing evolutionary and genetic algorithms for the Travelling Salesman Problem and the Cutting Stock Problem
Tiny framework for solving constraint satisfaction problems (CSP) with discrete and finite domains. This is a Java-based solution which is written in a functional programming style. Features Sudoku as an example application.
Code for the Software Engineering College Intern position Challenge. This code tries to retrieve n-items whose total value is greater than 95% of the value of the amount the user would like to spend and less than 105% of the amount the user desired to spend, by solving a CSP. DESCRIPTION: When giving gifts, consumers usually keep in mind two variables - cost and quantity. In order to facilitate better gift-giving on the Zappos website, the Software Engineering team would like to test a simple application that allows a user to submit two inputs: N (desired # of products) and X (desired dollar amount). The application should take both inputs and leverage the Zappos API (http://developer.zappos.com/docs/api-documentation) to create a list of Zappos products whose combined values match as closely as possible to X dollars. For example, if a user entered 3 (# of products) and $150, the application would print combinations of 3 product items whose total value is closest to $150.
CSP-Sudoku solver
solving sudoku problems with csp
C++ Crossword Solver using AC3 and Back Track Algorithms.
Joint (Maths & Computer Science) Senior Honours project on Graph Homomorphisms.
This is a Java based CSP solver that uses different search algorithms to find consistent solutions to the CSP
Cryptarithmetic Problem Solving using CSP
Constraint satisfaction problem (CSP) solver for Sudoku puzzles
Ce projet s'attache à mettre en place des optimisations au resolveur de CSP.
A constraint programming solver, relying on a backtrack paired with look forward algorithms.
Solving Class Scheduling problem using the CSP method.
CSP solver, using different approaches
Implementation of the CSP algorithm using a Sudoku Solver
Problem #345 - Matrix Sum
Implementation of constraint satisfaction problem algorithms to solve the radio link frequency assignment problem - rlfap
This repository contains various Python algorithms that cover a wide range of problem-solving scenarios.
Constraint Satisfaction Problem: Backtracking algorithm to schedule time slots and rooms for a given set of subjects.