Email address obfuscation in effect -- please
click here to turn it off.
[
Date Prev][
Date Next][
Thread Prev][
Thread Next][
Date Index][
Thread Index]
- To: MLUG Members <EMAIL:PROTECTED>
- Subject: Re: [MLUG] N-Queens Problem Solver
- From: Stephen Montgomery-Smith <EMAIL:PROTECTED>
- Date: Fri, 18 Apr 2008 09:48:07 -0500
- Delivery-date: Fri, 18 Apr 2008 09:48:56 -0500
- Envelope-to: EMAIL:PROTECTED
- In-reply-to: <EMAIL:PROTECTED>
- References: <EMAIL:PROTECTED>
- Reply-to: MLUG Members <EMAIL:PROTECTED>
- Sender: EMAIL:PROTECTED
- User-agent: Mozilla/5.0 (X11; U; FreeBSD i386; en-US; rv:1.8.1.13) Gecko/20080404 SeaMonkey/1.1.9
Michael Stegeman wrote:
Hey, not sure if any of you will find this at all useful or interesting,
but I wrote a program that solves the N-queens problem using a simulated
annealing algorithm very, very quickly. I solved a 100x100 problem in
just over 5 minutes, running at 1.83 GHz. If you download, open up the
source file and change "#define N 20" to whatever number you'd like.
Let me know what you think!
I was once involved in a programming competition related to this problem:
http://www.recmath.org/contest/AttackingQueens/Description.html
_______________________________________________
members mailing list
EMAIL:PROTECTED
http://mlug.missouri.edu/mailman/listinfo/members
Home | FAQ | Server | Presentations | Mailing Lists/Archives | Member Tools | Links | Sponsors | Contact