Re: [MLUG] N-Queens Problem Solver

["Jonathan King" <EMAIL:PROTECTED>]

If you click on the link, you'll find out that he got 40th place in
3d, and 35th place in 4d.

jking

On 4/18/08, Michael Stegeman <EMAIL:PROTECTED> wrote:
> Wow, that looks ridiculously difficult... That'd be interesting to try and
> code up, though!  Did you end up with a working solution?
>
> Michael Stegeman
> Undergraduate Student
> University of Missouri-Columbia
> 816-786-4858
> EMAIL:PROTECTED
>
>
>
> Stephen Montgomery-Smith wrote:
> > 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
> >
>
> _______________________________________________
> members mailing list
> EMAIL:PROTECTED
> http://mlug.missouri.edu/mailman/listinfo/members
>

_______________________________________________
members mailing list
EMAIL:PROTECTED
http://mlug.missouri.edu/mailman/listinfo/members