This is the 'automated' procedure that is describe in my MOEBIUS MADE EASY : you get immediateley the SPart and WEnd sequence ( for you to verify that there is a circuit or closed walk for one strand : that procedure is awfully easy ; if you don't get it just email me ! ) This is written for my HP 48GX in Hewlett-Packard RPL (Reverse Polish Lisp ) -------------------------------------------------------------- NET « @clean after running the pgm. must be individually "run"@ L0 PURGE {L0 LL S PO I} PURGE » -------------------------------------------------------------- EVENPG « @THE FULL PROGRAMM to be run when having an even number of strands@ BR BR4 » -------------------------------------------------------------- ODDPG « @THE FULL PROGRAMM to be run when having an odd number of strands@ BR BR3 » -------------------------------------------------------------- FIN2 « @the end : put all the results in ther stack / even number of strands@ 'SPart' LL 1 S 3 * FOR J L0 J GET RCL NEXT 'WEnd' 1 S 3 * FOR J L0 J GET RCL REVLIST NEXT » -------------------------------------------------------------- FIN « @the end : put all the results in ther stack / odd number of strands@ 'SPart' LL 1 S 2 * FOR J L0 J GET RCL NEXT 'WEnd' 1 S 2 * FOR J L0 J GET RCL REVLIST NEXT » -------------------------------------------------------------- SUBSTR2 « @MAKE THE MOVES WITH THE EVEN NUMBER STRANDS@ LL REVLIST 2 PO SUB LL REVLIST HEAD + LL REVLIST PO 1 + S SUB + REVLIST 'LL' STO » -------------------------------------------------------------- SUBSTR « @make the moves with the odd number of strands@ LL 2 PO SUB LL HEAD + LL PO 1 + S SUB + 'LL' STO » -------------------------------------------------------------- MIL « @take care of the move in the middle of the even strands@ LL 1 PO 1 - SUB LL PO 1 + GET LL PO GET LL PO 2 + S SUB + + + 'LL' STO » -------------------------------------------------------------- BR4 « @makes the even braid@ 0 'I' STO 1 S FOR J I 1 + 'I' STO SUBSTR LL L0 I GET STO I 1 + 'I' STO SUBSTR2 LL L0 I GET STO I 1 + 'I' STO MIL LL L0 I GET STO NEXT FIN2 » -------------------------------------------------------------- BR3 « @makes the odd braid@ 0 'I' STO 1 S FOR J I 1 + 'I' STO SUBSTR LL L0 I GET STO I 1 + 'I' STO SUBSTR2 LL L0 I GET STO NEXT FIN » -------------------------------------------------------------- BR « @need to have the list of strand in the stack afore being run { 1 2 3 ...n}@ {L1 L2 L3 L4 ....L60} @you may choise to put a number divisible by 3 like l120 if you want more@ @with l60 you can have 20 strands in even and 29 in odd@ 'L0' STO DUP 'LL' STO SIZE 'S' STO L0 1 S 3 * SUB 'L0' STO S 2 / CEIL 'PO' STO » --------------------------------------------------------------