Solvers: 

• Genetic Algorithm - 0/1 Multi-Constraint Knapsack Problem (C++) A genetic algorithm for the 0/1 multi-constraint (multidimensional) knapsack problem.
• Heuristic for Graph Coloring (Java) A simple implementation that uses the Iterated Greedy and Min-conflicts heuristics.
• Sudoku Solvers and Generator (C++, Java) Backtracking depth first Sudoku solver and generator.
• Simulated Annealing Algorithm - Multiple Choice Multidimensional knapsack problem (C++)
• Iterative Local Search - Quadratic Assignment Problem (C++) The implementation uses iterative local search with random restart.

Other Code Snippets:

• Monty Hall Simulation - The Monty Hall problem is a classical problem in probability theory. This snippet provides a proof (using a uniformly distributed random number generator) in the form of a simulation that it is indeed beneficial to switch doors.

shah AT freeshell DOT org /// shah DOT shalin AT gmail DOT com