COMBINATION_LOCK is a C program which simulates the process of determining the combination of a lock.
This program demonstrates the method of exhaustive search, that is, it searches for an answer by trying every possibility. This requires a way of logically ordering the possibilities.
The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.
COMBINATION_LOCK is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.
BICYCLE_LOCK, a C library which simulates the process of determining the secret combination of a bicycle lock, an integer between 000 and 999.
CHANGE_MAKING, a C library which considers the change making problem, in which a given sum is to be formed using coins of various denominations.
COMBO, a C library which includes many combinatorial routines.
KNAPSACK_01, a C library which uses brute force to solve small versions of the 0/1 knapsack problem;
PARTITION_PROBLEM, a C library which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
SATISFY, a C program which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.
SUBSET, a C library which enumerates combinations, partitions, subsets, index sets, and other combinatorial objects.
SUBSET_SUM, a C library which seeks solutions of the subset sum problem.
TSP_BRUTE, a C program which reads a file of city-to-city distances and solves the traveling salesperson problem, using brute force.
You can go up one level to the C source codes.