🚀 go-pugleaf

<chomp>
hello world .
Examine the following :                                                    

rubik_cube([],New_perm)    :- write(New_perm),!.
rubik_cube([H|T],New_perm) :-          
                              move_generator(H,New_perm,Newer_perm),
                              rubik_cube(T,Newer_perm).
                       

This predicate is invoked by a list of cube moves such as

rubik_cube([u,r2,l,r2],Resultant_perm)?

Fine. I can submit a list of 25 such moves to a program on my ibm-xt with
   512k running plvp+ but 26 moves causes a stack overflow.I would like
   225 moves in my list ...
   (Incidentally, the trace of 25 moves is truly impressive,filling the
   80 col screen for 10 minutes.)

My question to the net is : Since this program is list-driven and only
   recurses to split the list, how can I kill the thousands of 
   instantiations cluttering the stack when I move on to the next list element?
   (ie. kind of like a cut but instead of inhibiting backtracking,
        I want to inhibit recursive memory of past events)

Currently my program is 15k long and can solve u-face efficiently by using
   the tables published by Singmaster. Generalization to the whole cube group
   is trivial once I get prolog to handle a big list splitting.

Thistlewaite's algorithm will likely be the next predicate,graphics too...