Comment@ the aim is Defined Instance Operating that can simulate thinking use computer.

220---221---222
/ | /| / |
/ 120--/121-/-122
/ | / | / /|
/ 20 /--21/--/22
210---211---212/ /
/ |/ // |/ / |/ /
/ 110-/-111-/-112/
/ |// | / / |/
/ 10/---11/-/-12
200---201---202/ /
| / |/ / |/ /
100---101---102/
|/ |/ |/
0 ---1 ---2
All directions are following:
The steps is one by one principle says that if a element walks correctly when each input is drawn from the set, then it walks correctly on arbitrary peripheral input numbers. (The numbers can be integers; in general, any set of values from any linearly ordered set.) As we construct managing element walks and other comparison element walks, use the one by one principle will allow to focus on their operation for input sequences consisting solely EXCHANGE of 0's and 1's. Once we have constructed a object elements walk and proved that it can sort all object-elements sequences, we shall appeal to the one by one principle to show that it properly nature sequences of arbitrary values.
Move to up ;add 1*z note(x=1 decimal, y=10, z=100)
Move to down ;subtract 1*z
Move to right ;increase 1
Move to lift ;reduce 1
Move to backward ;subtract 1*y
200 202 220 222
111 111
0 2 20 22
?Move to diagonal vertex ;
?Move to apex ;
?Move to base ;