This page (revision-9) was last changed on 03-Feb-2023 15:21 by Gromit 

This page was created on 13-Mar-2010 14:34 by Carsten Strotmann

Only authorized users are allowed to rename pages.

Only authorized users are allowed to delete pages.

Page revision history

Version Date Modified Size Author Changes ... Change note
9 03-Feb-2023 15:21 3 KB Gromit to previous
8 26-Jan-2011 10:35 3 KB Gromit to previous | to last
7 26-Jan-2011 10:34 3 KB Gromit to previous | to last
6 26-Jan-2011 10:33 3 KB Gromit to previous | to last
5 26-Jan-2011 10:30 2 KB Gromit to previous | to last
4 26-Jan-2011 10:28 2 KB Gromit to previous | to last
3 13-Mar-2010 14:36 301 bytes Carsten Strotmann to previous | to last
2 13-Mar-2010 14:35 298 bytes Carsten Strotmann to previous | to last
1 13-Mar-2010 14:34 180 bytes Carsten Strotmann to last

Page References

Incoming links Outgoing links

Version management

Difference between version and

At line 1 changed one line
!!!Eight Queens
!General Information
At line 3 removed 2 lines
General Information
At line 9 removed 2 lines
[{Image src='8queensaction.gif' }]
At line 8 added 14 lines
!!!8 QUEENS ACTION!
!!92 chess solutions in 40 seconds
Program by Dave Oblad\\
''Lightning fast ACTION! solution to "The Eight Queens Problem" from the April, 1985 Antic. Requires the ACTION! programming language cassette from Optimized Systems Software. Works on all 8-bit Atari computers of any memory size, with disk or cassette. Disk subscribers: You can use this program without ACTION! Select the "L" option from DOS 2 for the file, QUEEN EXE.''
In line with Antic's long-held belief that our published programs are part of a two-way communications process with readers of the magazine, many Antic programming take-aparts conclude with suggestions for possible enhancements that an ambitious programmer might make in the listings.
But Dave Oblad took it as a personal challenge when he saw Angelo Giambra's "The Eight Queens Problem" in the April, 1985 Antic and read our final comment: "For a real challenge, you might want to try modifying the program so that only the 12 unique solutions are found."
(The original April article showed that there are 92 possible ways to arrange eight queens on a chessboard so that none of them threatens another. As the most powerful chess piece, a queen can attack for any distance along any straight line.)
In Dave's letter to Antic, he wrote, "I spent the next two days cranking away at my Atari in the ACTION! language, which is much faster than BASIC. My algorithm solves and displays all 92 general solutions in approximately 40 seconds-and finds the 12 unique solutions in 30 seconds."
At line 146 changed one line
PRINTE("PRESS ÓÔÁÒÔ TO RE-RUN")
PRINTE("PRESS START TO RE-RUN")