Here is a "slightly more j-like" re-implementation.
I presume it's approximately a "work-alike". (I say approximately
because of the random aspect of its implementation):
NB. solution to the Traveling Salesman Problem using a genetic algorithm
NB. to find the minimum cost path through all cities.
Yes, I miss that somehow. Now I just have to implement a line level copy
and paste (e.g., spcopy n m and sppaste n). It might not ideal but
adequate enough.
Thanks again
On Sun, Dec 20, 2015 at 2:20 PM, Eric Iverson
wrote:
> You might already have what you want. That is,
>
>sp'' NB. equiv
Typo - last minute name change - the unused reference to nextchild, at
the end, should have been
nextchildren=. nextchildren + 2
Thanks,
--
Raul
On Mon, Dec 21, 2015 at 8:13 AM, Raul Miller wrote:
> Here is a "slightly more j-like" re-implementation.
>
> I presume it's approximately a "work-
JHS upodate 211 is now available.
Primarily changes in simple projects.
See nouns sphelp and spxhelp.
--
For information about J forums see http://www.jsoftware.com/forums.htm
My "all factors algorithm" isn't quite as slick as Henry's, and for part
2 I computed the presents for days one through eight-hundred thousand
all at once, rather than a day at a time. I chose against testing for a
finished condition. For some reason I didn't seem to get the amend in
place wo
Thanks, everyone, for your responses. Hopefully I'll have some time over
the holidays to look at this and compare it to some sources in C# I found
online.
On Mon, Dec 21, 2015 at 11:25 AM, Raul Miller wrote:
> Typo - last minute name change - the unused reference to nextchild, at
> the end, sho
