Introduction:
This is the first article of a series i'm going to present here.
The entire series will be dealing with the 8 queens problem,or more general the n-queens-problem.
I assume that all of you know what the problem is about.
If not just google it out, there are loads of resources. Also i will shortly explain what it's all about.
So why dedicate quite some articles to this problem?
Well at a first glance it's just a relativly easy scientific problem.
But if you look closer you'll notice that solutions to this problems can be generated in quite many ways. Not few of them offer interesting applications beyond the problem itself.
The n-queens-problem is very well suited for studying various algorithms.
It's very easy to comprehend thus you can focus on solving it efficiently.
This first article attacks the problem with a genetic algorithm. I thought it's probably the most interesting to start with and shows some general ideas.
Note that it is not proven tha... View In Full
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
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
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
