Pancake numbers: Difference between revisions
m
→exhaustive search, with examples
m (→Phix: added rhs flips and number found) |
|||
Line 608:
{{out}}
Note that we are only allowed to flip the left hand side, so [eg] we cannot solve p(3) by flipping the right hand pair.<br>
lhs-only flips, the "of nn" shows how many unique stacks we found that required p(n) flips.
<pre>
p(1) = 0, example: {1} (of 1, 0s)
Line 623:
After p(7), each subsequent p(n) takes about n times as long to complete.<br>
rhs-only flips, using the two commented-out alternative lines in visitor(), and again showing the last one found, is more similar than I expected.
<pre>
p(1) = 0, example: {1} (of 1, 0s)
| |||