Puzzle With this version of the latter algorithm can be written as follows: Take
disk 1 on disk (or piece of base) that is not the same color.
"If all the disks are in C, end. If not, move a disk other than 1 and returns to step 1.
- The smallest disk is not the only one not ever put on another of a different color,
at any time there are two discs of the same color together.
0 comments:
Post a Comment