I have been looking at the genetic algorithm again and thought
the 8-queens problem would be an interesting challenge for
figuring out a representation structure to encode the problem.
I thought one queen per row in any of the 8 horizontal positions,
generate a collection of "rows", then construct an 8x8 board one
row at a time then check the vertical and diagonal vectors to
evaluate a "solution".
I recall the knights tour using backtracking as an early assignment
in Pascal in the mid-80s undergrad CompSci. The Wikipedia article on
8-queens shows Wirth's backtracking program.
I hope to get around to it before the end of the year. Anyone
else tried GA on the 8-queens?
Stephen Thompson
On 10/4/2013 2:35 PM, Frank Wimberly wrote:
This came up at physical Friam this am.
http://en.wikipedia.org/wiki/Eight_queens_puzzle
Frank
Frank C. Wimberly
140 Calle Ojo Feliz
Santa Fe, NM 87505
[email protected]
<mailto:[email protected]>[email protected]
<mailto:[email protected]>
Phone: (505) 995-8715 Cell: (505) 670-9918
============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
to unsubscribe http://redfish.com/mailman/listinfo/friam_redfish.com
============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
to unsubscribe http://redfish.com/mailman/listinfo/friam_redfish.com
