|
User Name
|
closure |
|
Unique Hits
|
2,114 |
|
Real Name
|
david |
|
Location
|
Germany |
|
Occupation
|
- - - |
|
Gender
|
Male |
|
Age
|
31 Years Old |
|
WebSite
|
- - - |
|
|
N-Queens-Series Part I (Only the fittest survive)
Programming
|
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
 |
13 Comments |
9.67 out of 10 |
|
|
|
|
Solving the N-Queens-Problem Part I
|
Scheme
|
4.30 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.80 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.80 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
|
|
| Please login to post comments. |
|
|
It's half finished. I'm quite busy at the moment, but it i'll do my
best to finish it soon.
cheers
|
|
|
So when's the next in the N-queens articles coming out? I can't wait to
read it.
|
|
|
Thanks David.
I was on #chicken yesterday and elf re-worked a lot of my code to make it better. I
learned a lot. He's a nice guy.
I look forward to reading your notes too. The code posted has a lot of room for
improvements.
|
|
|
What are those errors? Pleas pm me. it's much more convinient than the
comments-system
|
|
|
I had downloaded chicken, but it gives out errors
|
|
|
How do i execute this scheme program of Solving the N-Queens problem Part 1
|
|
|
Yup, I ended up talking to him for a while. Seems like a nice guy.
|
|
|
Hey. I stopped by those IRC chats you were talking about. I guess you weren't
online at the time.
|
|
|
Hey mate,
Sorry to bug again.
But in your About Me, you say you code ruby as a profession?
Would you mind me asking, what do you have to do. Do you mean as in, For the web?
|
|
|
Hey man
Can i just ask.
What do you have to use to run CL?
I found something but it was $49, is that what i need to get?
Cheers.
|
|
|
