... from stack and store at HERE \ (ignore piece0, it was put in solve0) \ (non-destructive because we need the data for backtracking). : store-solution ( piece0 start-shift piece1 shift1 ... pieceN board ) DEPTH 2 - PICK ( absolute-shift ) DEPTH 3 - 2 SWAP DO I PICK OVER put-piece I 1- PICK + -2 +LOOP DROP ; : check-solution HERE 64 smallest 64 COMPARE 0<...

... ideas, mostly for code reduction, but maybe they are also faster. 1. Calculate absolute shift on the stack, eliminating "shift" and "adjust": \ variable shift \ : adjust ... : store-solution ( pieceN shiftN ... piece0 board ) 0 ( absolute-shift ) here 64 [char] * fill depth 1- 2 swap do i pick over put-piece i 1- pick + -2 +loop drop ; ...

..., but maybe they are also faster. 1. Calculate absolute shift on the stack, eliminating "shift" and "adjust": \ variable shift \ : adjust ... : store-solution ( pieceN shiftN ... piece0 board ) 0 ( absolute-shift ) here 64 [char] * fill depth 1- 2 swap do i pick over put-piece i 1- pick + -...

...I had some more ideas, mostly for code reduction, but maybe they are also faster. 1. Calculate absolute shift on the stack, eliminating "shift" and "adjust": \ variable shift \ : adjust ... : store-solution ( pieceN shiftN ... piece0 board ) 0 ( absolute-shift ) here 64 [char] * fill depth 1- 2 swap do i pick over put-piece i 1- pick + -2 +loop drop ; 2. Condense the ...

... variable shift : adjust ( shift -- shift' ) shift @ tuck + shift ! ; \ extract solution from stack and store at HERE \ (non-destructive because we need the data for backtracking). : store-solution ( pieceN shiftN ... piece0 shift0 board ) 0 shift ! here 64 [char] * fill depth 1- 2 swap do i pick i pick adjust swap put-piece -2 +loop ; : .line ( line -- line+6...