|
|
Solving the N-Queens-Problem Part I
|
Scheme
|
3.88 Years Ago
|
4
|
|
9.00
|
- - -
|
8,447 Chrs
|
|
|
This is the source-code to a series i'm going to start here in the coding-articles part.
It implements a genetic algorithm to solve the n-queens problem. The purpose of the algorithm is to be compreh
|
|
|
|
Recursive Lambdas with the Y and U Combinator
|
Scheme
|
4.38 Years Ago
|
0
|
|
9.00
|
- - -
|
1,057 Chrs
|
|
|
In scheme you meet recursion almost anywhere. It's a natural thing, that can be naturally expressed in this language. There is one exception though. I'm talking of lambdas, that are by nature anonymou
|
|
|
|
down the tree
|
Scheme
|
4.38 Years Ago
|
4
|
|
8.00
|
- - -
|
2,929 Chrs
|
|
|
This piece of code was made when i helped a friend of mine in his university class on datastructures.
It's a very simple imlementation of binary-trees in scheme. The task was the following:
given to
|
|
|
|
simple constraint problem solver
|
Scheme
|
4.55 Years Ago
|
0
|
|
- - -
|
- - -
|
1,472 Chrs
|
|
|
Some day i needed to build a constraint solver for my dayjob. So i started out by trying some different approaches. The one i present here is not the one, i finally took, but it's one of the shortest.
|
|
|
|
