Solve the one to nine puzzle with a utility function that handles the depth first search. First saw the puzzle here: http://msdn.microsoft.com/en-us/vcsharp/ee957404
0 people like thisPosted: 8 years ago by dave jones
Using the general solve function to solve Sudoku. The puzzle specific code was translated from Norvig's Sudoku code, but any errors are mine. Reuses code from fssnip.net/6m and fssnip.net/6n
0 people like thisPosted: 8 years ago by dave jones
Find the longest consecutive sub-sequence of increasing numbers.
0 people like thisPosted: 8 years ago by Naveen
Generating a state space tree to the Missionaries and Cannibals Problem (http://en.wikipedia.org/wiki/Missionaries_and_cannibals_problem). Then, this tree is iterated with depth-first approach, printing all the visitations. The solutions to problem have a depth equals 9.
13 people like thisPosted: 5 years ago by Fabio Galuppo
Eternity 2 Solver via Z3.
2 people like thisPosted: 2 years ago by NIck Palladinos
Code to solve the N-Queens problem.
3 people like thisPosted: 8 years ago by dave jones
This program is written in only 99 lines of actual code and remains enough readability. I used few short-coding technics. 1. no XAML. 2. pre-calculate every useful data for the purpose of eliminating useless states 3. using record type with set property as an alternative of view-model 4. initialize everything in one place. 5. encapsulate all states in one place.
16 people like thisPosted: 8 years ago by nagat01
Creates all possible mobile phone letter combinations from a number.
2 people like thisPosted: 7 years ago by Phillip Trelford
Solve the 8 queens problem in F#, keeping available positions on the board as a list of X,Y coordinates.
2 people like thisPosted: 3 years ago by Tomas Petricek