<html>
  <head>
    <meta content="text/html; charset=windows-1252"
      http-equiv="Content-Type">
  </head>
  <body bgcolor="#FFFFFF" text="#000000">
    <div class="moz-cite-prefix">Joel Neely schreef op 16-2-2015 om
      14:07:<br>
    </div>
    <blockquote
cite="mid:CAEEzXAioDrGUgkg8QvGaAP4sBWoi0FxbbOhJdmqTr2cd4BB-_A@mail.gmail.com"
      type="cite">
      <div dir="ltr">
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">I'm sorry,
          but I must disagree with the generalization.</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small"><br>
        </div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">You
          described "the very nature" of a typical recursion over a
          list:</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">(1) deal
          with the head, then</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">(2) deal
          with everything else.</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small"><br>
        </div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">But lists
          are not the only recursive structure. Infix-order processing
          of a tree, for example, is more naturally described as:</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">(1) deal
          with the left sub-tree (the first "everything else"),</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">(2) deal
          with the parent (analogous to the head of a list),</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">(3) deal
          with the right sub-tree (the second "everything else").</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small"><br>
        </div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">At the risk
          of a spoiler...</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small"><br>
        </div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">.</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small"><br>
        </div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">.</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small"><br>
        </div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">.</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small"><br>
        </div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">.</div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small"><br>
        </div>
        <div class="gmail_default"
          style="font-family:georgia,serif;font-size:small">One approach
          to the Towers of Hanoi problem emerges nicely from thinking of
          the moves as a tree.</div>
        <br>
      </div>
    </blockquote>
    <br>
    You did not spoil everything.<br>
    <br>
    As I see it , it will be like this : <br>
    <br>
    1) deal with peg a <br>
    2) deal with peg b <br>
    3) deal with peg c <br>
    <br>
    I think this is workingt to a recursive solution.<br>
    <br>
    Roelof<br>
    <br>
  </body>
</html>