Analysis of Hanoi solver
(c3 dec boostq defnp c4 calltp c3 c5 calltp endnp)
Prefix increases P of double-recursive procedure: Hanoi(S,A,D,n): IF n=0 exit; ELSE BEGIN Hanoi(S,D,A,n-1); move top disk from A to D; Hanoi(A,S,D,n-1); END
Prefix boosts instructions of 2nd frozen program, which happens to be the 1n2n solver. Rewrites the search procedure itself!
Prefix probability: 0.003; suffix probability: 3 * 10-8; total probability: 9 * 10-11
Suffix probability without prefix execution: 4* 10-14
That is, Hanoi does profit from 1n2n experience and incremental learning (where OOPS excels)
Back to J. Schmidhuber's OOPS page