Puzzle - RPL and others

[C.Ret]

Hi everyone,

By reading all your codes, comments and observations, I found away to a shorter (161.5 octets) and speed up (0'19") the code for my HP-28S:

Code:

NBLD:
« DEPTH OVER 10 * → d n
   « d n d MOD - 9 FOR k
          IF n →STR k →STR POS NOT THEN n k + IF d 9 ≠ THEN NBLD ELSE KILL END END      
     k 2 MAX STEP DROP » »

Usage:
Clear stack, enter 0 and press the NBLD soft menu key.
Result 381654729 appears after only 19 seconds on level 1:

Don't forget to clear the stack as it is used for storing intermediates values for the recurrence and the depth of stack must correspond to the depth of the seek !
A previous version was taking care of digit 5 at position 5, but, since this happen only one time in the scan at values 165 & 1652, this former version was a waste of time and bytes.
The simplest version is much faster and shorter than the complicated one taking account for the position of digit 5.