...I've linked to it
from a small page on magic stars I've written myself (I've called them
magic polygrams): http://www.gwywyr.com/articles/scimaths/polmagic.html
I put the complements of orders 15 to 20 which I took from his site
(with his permission) on my Bigstars page.
In an email of July 16, 2001, he describes his Pascal program this way.
It's very crude but I hope it will work okay for you. Essentially what it does is set up an array to represent the magic star, count the total of each line, then swap two random points at a time until the (sum of totals) - (magic-total*vertices) drops, ideally to zero. When you've found a magic star, you can save it to disk, then read it again as required. I don't understand magic stars well enough to make the search systematic, so I'd be interested to see your exe program and its Basic listing.
In an August 31, 2003 email he says (in part)
...Since then I've written a program that finds magic polygrams much quicker than my previous one, and I hope the following is data for magic 21-, 22-, and 23-agrams.
This solution for a 23-v magic polygram was included in the above email:
Line by line values are
In an email of September 2, 2003
No, I've been
surprised by how quick it is: I found a 21-agram in just under 60 seconds
today (and I haven't got a fast computer). Here are three more big stars,
each of which took less than half-an-hour to find.
Email of September 8, 2003
I've now got polygrams 6-50, with the 29-agram found in under ten seconds. Funny that last month I was wondering if I'd ever be able to get the 21-agram...
Email of September 9, 2003
I'm attaching the data
for the stars in a text file.
Email of November 1, 2003
A small text file of star A solutions, orders 15 - 50, supplied by
Simon Whitechapal, Sept. 9, 2003 is available
here for downloading.