Test case generation of classic N-Puzzle game using Z3
-
Updated
Dec 14, 2015 - Python
Test case generation of classic N-Puzzle game using Z3
Solution finder for a popular mobile game "Flow Free". Solution for this game is in NP-Complete. Derived a polynomial time reduction algorithm to reduce the problem to satisfiability problem.
Verify Regulation Kernels using SMT. This repository is a public mirror, pull requests will be merged manually.
Computing universality of Finite-State Automata using z3 solver.
CS228 IITB, sudoku solver, n-queens solver, subset finder etc using z3
Python library for solving Binary Puzzles using Z3.
solving-satisfaction-problems-with-theorem-provers
CP and SMT model to solve the Present Wrapping Problem (PWP): given a wrapping paper roll of a certain dimen- sion and a list of presents, decide how to cut off pieces of paper so that all the presents can be wrapped. Consider that each present is described by the dimensions of the piece of paper needed to wrap it. Moreover, each necessary piece…
Python: Linear Programming Interface (ppl,z3)
Symbolic Execution for Python
This repo contains the logic to solve sudoku puzzles using a basic backtracking algorithm and an smt-solver-based approach.
Code and exercises for a workshop on z3 and angr
Add a description, image, and links to the z3 topic page so that developers can more easily learn about it.
To associate your repository with the z3 topic, visit your repo's landing page and select "manage topics."