A modern C++ library for efficiently and easily iterating through common combinatorial objects, such as combinations, permutations, partitions and more.
-
Updated
May 22, 2022 - C++
A modern C++ library for efficiently and easily iterating through common combinatorial objects, such as combinations, permutations, partitions and more.
State-of-the-Art method for solving the Rubik's Cube
Code for path planning in dynamic environments with adaptive dimensionality
Foofah: programming-by-example data transformation program synthesizer
Code for the paper "Addressing Model Vulnerability to Distributional Shifts over Image Transformation Sets", ICCV 2019
A powerful & flexible Rubik's Cube solver
Library for combinatorially specifying, constraining, and exploring genetic design spaces.
Knuth's Dancing Links algorithm in Java
A python library for solving combinatorial search problems
A C++ program that resolve a TSP problem using Local Search and Tabu Search metaheuristics with small variants. Download report here https://github.com/EduBic/TSP-MetaheuristicSolvers-Documentation/releases
evolutionary computing / genetic algorithm
Are there Sudokus with hints only on the boundary?
This repository is about Multiple Courier Planning Problem a well-known NP-hard problem.
Fast randomized algorithms for combinatorial optimization
a python library to build permutations sequences with various constraints (Combinatorial Search)
McSplit+DSB (Degree Sequence Bound) Implementation
A fun little combinatorial search project of packing words into bins, to be implemented in Java 11.
McSplit+BSam (Branch Sampling) Implementation
一款轻量级、易用的财务/数据分析辅助工具,帮助用户快速从大量数字中找出符合特定和值的组合。支持 Excel 文件导入和直接粘贴数字,采用回溯剪枝算法快速查找结果。A lightweight and user-friendly financial/data analysis tool that helps users quickly find number combinations that sum to a specific target value. Supports Excel file import and direct paste, with fast backtracking algorithm.
Uses backtracking (DFS-style traversal) to explore all character arrangements from the input string. Tracks each recursion depth (tree level) and stores the generated paths. After recursion, it removes duplicates at each level and returns the count of all unique character paths (not just full permutations).
Add a description, image, and links to the combinatorial-search topic page so that developers can more easily learn about it.
To associate your repository with the combinatorial-search topic, visit your repo's landing page and select "manage topics."