TweetFollow Us on Twitter

Towers
Volume Number:2
Issue Number:1
Column Tag:Threaded Code

Animated Hanoi Towers in NEON

By Jörg Langowski, EMBL, c/o I.L.L., Grenoble Cedex, France, MacTutor Editorial Board

Lately, we have had a number of requests for a column on NEON. Since no neon articles have been forth coming, I have been asked to temporarily switch from my usual Forth ramblings to NEON. Since NEON is so close to Forth, we have decided to show a NEON example this month for a change. In light of this, we will re-name this column "Threaded Code" to cover all the Forth like object oriented languages that are Forth derivatives on the Mac.

The principles of object oriented programming have already been explained in several earlier columns (see LISP V1#6, NEON V1#8), so I am not going to dwell on that here. Rather, we are going to look at the famous Towers of Hanoi algorithm from an object-oriented point of view, gaining some on-hands experience with an example that - I feel - is particularly appropriate for this approach.

Let's recall: The 'towers' are three stacks of disks (Fig. 1). The leftmost one is filled with n disks stacked on top of one another in order of decreasing size, the other two are initially empty. The objective is to move the disks from the leftmost to the rightmost position, one by one, in such a way that a larger disk is never put on top of a smaller one. This works if one uses the middle position as a 'scratchpad' (try it out with pieces of paper), even though this is a rather tiresome procedure, if performed manually.

Fig. 1: Initial and final positions of Towers of Hanoi.

This is, of course, where Mac comes in; and the algorithm to solve the puzzle is very short if written recursively. In pseudo-Pascal it would look like this (see also John Bogan's Modula-2 column in V1#6):

procedure hanoi (n, start, inter, finish:integer);
    begin
     if n<>0 then 
 begin
 hanoi (n-1, start, finish, inter);
 move (n, start, finish);
 hanoi (n-1, inter, start, finish)
 end
    end;

where n is the number of disks, and start, inter and finish denote the starting, scratch and final positions for the disks. move is a procedure that (somehow) moves the disk from one stack to another.

OK, so if we set up a stack of disks, provide three towers to put them on to, and execute this procedure, we should be able to watch how Macintosh solves the Towers problem.

There are two things to notice: First, the definition is obviously recursive, second, we have to be careful how to represent our data.

Recursive definitions - NEON and MacForth

A very simple recursive procedure is the definition of the factorial of an integer number, which is given at the very beginning of the program example (listing 1). This definition works in NEON; you may refer to a word within the definition of the word itself (By the way, even if you weren't allowed to do it that way, you could resort to the forward declaration).

MacForth, however, sets the smudge bit in the vocabulary while compiling a new definition; therefore the word being defined is not known to the system at compile time and cannot be referred to by itself. You have probably seen the effect of the smudge bit already; when the compiler exits a declaration due to an error, words will show the first letter of the latest definition changed (in fact, it has the 8th bit set). One can easily circumvent this restriction by writing

: factorial   [ smudge ] 
   dup if dup 1- factorial * else drop 1 then ;
smudge

i.e., executing smudge during the compilation of factorial and resetting it afterwards. This will give a working definition, within the limit that is given by the 32-bit maximum integer size of the Macintosh.

Representation of disks and towers as NEON objects

Since we are, in fact, simulating material objects, moving them around and also displaying the result of our simulation on the screen, the Towers of Hanoi problem seems to be idealy suited for an object oriented language like NEON. We could define 'disks' as objects that can be drawn, put on top of other objects, called 'towers' and moved between them. The towers will automatically keep track of how many disks are on them, the disks will 'know' what tower they are on and how to 'draw themselves'.

The Three Towers

There is one predefined class in NEON, ordered-col, that represents a list of variable size. Elements of that list are 4-byte entities. A tower in our example will be an ordered-col of specified maximum size. In addition, it will have a certain position on the screen, which can be accessed by the methods getX: and getY: and a draw: method that draws the tower at its position in the current grafPort. That's all we need as a 'stacking device' for the disks. Everything else is taken care of by the disks themselves, as you will see soon.

The instance variables needed for every object of class tower are: rects that correspond to the base and the post, and ints that contain the x and y position of the center of the base.

Now we could start our simulation by creating three tower objects, e.g.

 tower babylon
 tower london
 tower pisa

Except for the fact that this looks cute, there is really no advantage in having named objects here. Just to make the point, and as an example how objects can be made to refer to other objects, we set up the three towers as a 3-element 4-byte array towers. This gives the additional advantage that we can refer to them by index. The array is initialized by the word make.towers, which shows how one can create 'nameless' objects on the heap with the heap> prefix (in my review copy of NEON, this information is hidden somewhere in the pages of Part III Chapter 1; I am confident that a revised manual will have this in the glossary).

xcenter ycenter ndisks heap> tower will leave on the stack the address of a new object of class tower created on the heap. The tower contains ndisks disks, and its base is centered at (xcenter,ycenter).

ndisks make.towers creates three of these gizmos equally spaced near the bottom of the screen, each of them having space for disks, but no disks on them yet. Their addresses are put into the array towers.

draw.towers will draw the towers, but not the disks. In this definition you see how one makes use of late binding; we want to send a draw: message to an object which is exactly known only at execution time (since towers could contain any kind of address). Therefore, if we want to draw the i-th tower, we have to write draw: [ i at: towers ] . (The same is true in immediate execution mode: draw: addr will abort with an error message, while draw: [ addr ] will do the correct thing, if addr is the address of a 'drawable' object. )

After you're finished with the example, you might want to dispose of them by calling dispose.towers. The same should be done to the disks; try writing a definition that will do the job.

Moving around the disks

The disk objects are more complicated than the towers. They have to be initialized and drawn; they will come in different sizes; and they will move around, sitting on one of the three stacks at any given time.

Since the disks won't shrink or grow, their size is known at initialization time and will be passed as a parameter to classinit:. This method also needs to know which tower the disk is on at the beginning (we pass the address of the tower object and put it into the instance variable which). The newly created disk it then put on top of the tower which it is associated with.

The draw: method is not quite general for disks, but very specialized for Hanoi disks: it makes use of the fact that a disk is only drawn right after it has been put on top of a stack. Since the size of that stack is known (by executing size: [ get: which ] ), the position of the topmost disk is exactly determined. Therefore, draw: calculates first the coordinates of the center of the disk and saves them in instance variables for later use, then does the necessary Quickdraw calls. If one wanted to do other things with the disks, e.g. drawing them at different places, one might want to factor out the code that calculates the coordinates.

undraw: removes the disk from its position (but not from the list which is being kept in the tower), and redraws the little black rectangle, the part of the post that had been overwritten previously. Here again, you see that a special assumption about the behavior of the disk is made: namely, that it does not cover anything but a certain part of the tower post.

dest move: finally will move a disk from wherever it was to the tower dest, undrawing and redrawing as necessary.

Object Interdependence

You see the line that we draw between general and specialized behavior of objects. The fact that a disk is displayed as a pattern-filled rectangle that takes up a certain amount of space on the screen is a behavior that would be general to any 'disk-like' object (unless we choose to rotate it as well). Association to another object, the tower, would also be something that could be implemented into an idealized 'general' disk. But the fact that this other object has a certain shape and that the disk can only be put onto it in a certain manner is extra information which the disk 'knows' about and which is used within the code that defines some of its methods.

To make the objects even more independent, 'MacDraw-like', would require a much more sophisticated interface between towers and disks than given here. One would then rather start by defining a subclass of window which has e.g. an ordered-col of objects associated to it, and which would be updated each time one of the objects is moved. I felt this would have created too much overhead to the program example. But you can see that MacDraw is not very far away, just go ahead and create that window, a set of objects and their appropriate behavior, and there you go... send us the code when you're done, we'll publish it.

Main routine

The main routine simply creates a Hanoi puzzle of ndisks disks and draws the initial position. ndisks i j k hanoi will move those disks ( or less, if you set ndisks differently) according to the rules of the game from tower i via j to k. Try

10 main
10 0 1 2 hanoi

or, to create a 'forbidden' pattern

10 main
5 0 1 2 hanoi
5 0 2 1 hanoi
5 1 0 2 hanoi

Have fun! Determined FORTH programmers might try to rewrite this example into MacForth or some other Forth. The Hanoi routine itself is simple. Doing the data representation in the same way should look rather more complicated...

Change of address

We have moved in the meantime. Please address all questions, remarks, suggestions, etc. regarding this column to:

Jörg Langowski

EMBL, c/o I.L.L., 156X

F-38042 Grenoble Cedex

France

Listing 1: Towers of Hanoi code
( © 110285 MacTutor by JL )
: factorial   dup if dup 1- factorial * else drop 1 then ;

:class tower <super ordered-col
        rect base
        rect column
        int xcenter
        int ycenter

    :M classinit: ( xcenter ycenter -- )
            put: ycenter put: xcenter 
            get: xcenter 70 -  get: ycenter 16 - 
            get: xcenter 70 +  get: ycenter   put: base
            get: xcenter 4 -   get: ycenter 
 limit: self 10 * 50 +  -
            get: xcenter 4 +   get: ycenter 16 - 
 put: column 
    ;M

    :M draw:  0 syspat dup fill: base fill: column ;M
    :M getX:   get: xcenter ;M
    :M getY:   get: ycenter ;M

;class

:class disk  <super object
        int size
        var which
        rect image
        int xc  int yc
    :M classinit: ( which size -- )   
                    put: size  put: which 
                    addr: self  add: [ get: which ] ;M
    :M draw: 
            getX: [ get: which ] put: xc 
            getY: [ get: which ] 
                 12 - size: [ get: which ] 10 * - put: yc
            get: xc get: size -  get: yc 4-   
            get: xc get: size +  get: yc 4+  put: image
            3 syspat fill: image  draw: image 
    ;M

    :M undraw: 19 syspat fill: image
            get: xc 4- get: yc 4- 
            get: xc 4+ get: yc 4+  put: image
            0 syspat fill: image
    ;M

    :M move: { dest -- }
            undraw: self
            addr: self add: [ dest ]
            size: [ get: which ] 1-  
            remove: [ get: which ]
            dest put: which   draw: self
    ;M
;class
3 array towers
: make.towers { ndisks -- }
   3 0 do 
      i 150 * 100 +  280 ndisks  heap> tower  
      i to: towers  loop ;

: draw.towers
   3 0 do draw: [ i at: towers ] loop ;

: dispose.towers   3 0 do  i dispose: towers loop ;

: hanoi { n start inter finish -- }
   n if   n 1-  start finish inter hanoi
          finish at: towers  
               move: [ last: [ start at: towers ] ]   
          n 1-   inter start finish hanoi
     then
;
: main  { ndisks -- }
    ndisks make.towers  cls draw.towers
    ndisks 0 do 
       0 at: towers 6 ndisks i - 4* + heap> disk drop 
                       draw: [ last: [ 0 at: towers ] ] loop
;
 

Community Search:
MacTech Search:

Software Updates via MacUpdate

Macs Fan Control 1.5.14 - Monitor and co...
Macs Fan Control allows you to monitor and control almost any aspect of your computer's fans, with support for controlling fan speed, temperature sensors pane, menu-bar icon, and autostart with... Read more
VueScan 9.7.96 - Scanner software with a...
VueScan is a scanning program that works with most high-quality flatbed and film scanners to produce scans that have excellent color fidelity and color balance. VueScan is easy to use, and has... Read more
FileMaker Pro 19.6.1 - Quickly build cus...
FileMaker Pro is the tool you use to create a custom app. You also use FileMaker Pro to access your app on a computer. Start by importing data from a spreadsheet or using a built-in Starter app to... Read more
Duet 3.1.0.0 - Use your iPad as an exter...
Duet is the first app that allows you to use your iDevice as an extra display for your Mac using the Lightning or 30-pin cable. Note: This app requires a iOS companion app. Release notes were... Read more
Firefox 107.0.1 - Fast, safe Web browser...
Firefox offers a fast, safe Web browsing experience. Browse quickly, securely, and effortlessly. With its industry-leading features, Firefox is the choice of Web development professionals and casual... Read more
War Thunder 2.21.1.91 - Multiplayer war...
In War Thunder, aircraft, attack helicopters, ground forces and naval ships collaborate in realistic competitive battles. You can choose from over 1,500 vehicles and an extensive variety of combat... Read more
Numbers 12.2.1 - Apple's spreadshee...
With Apple Numbers, sophisticated spreadsheets are just the start. The whole sheet is your canvas. Just add dramatic interactive charts, tables, and images that paint a revealing picture of your data... Read more
DEVONthink Pro 3.8.7 - Knowledge base, i...
DEVONthink is DEVONtechnologies' document and information management solution. It supports a large variety of file formats and stores them in a database enhanced by artificial intelligence (AI). Many... Read more
Drive Genius 6.2.3 - $79.00
Drive Genius features a comprehensive Malware Scan. Automate your malware protection. Protect your investment from any threat. The Malware Scan is part of the automated DrivePulse utility. DrivePulse... Read more
VLC Media Player 3.0.18 - Popular multim...
VLC Media Player is a highly portable multimedia player for various audio and video formats (MPEG-1, MPEG-2, MPEG-4, DivX, MP3, OGG, ...) as well as DVDs, VCDs, and various streaming protocols. It... Read more

Latest Forum Discussions

See All

‘Genshin Impact’ Version 3.3 Pre-Install...
Following the reveal of the release date and more for Genshin Impact (Free) version 3.3 ‘All Senses Clear, All Existence Void’, HoYoverse showcased the Genius Invokation TCG that arrives this week in the update. | Read more »
TouchArcade Game of the Week: ‘Sling Min...
The world of PC games has always blown my mind because there’s just SO MUCH stuff out there that it’s not uncommon at all for there to be a game that’s well-liked and well-reviewed, and seemingly quite popular with a solid fanbase, and have it be... | Read more »
SwitchArcade Round-Up: Reviews Featuring...
Hello gentle readers, and welcome to the SwitchArcade Round-Up for December 2nd, 2022. So, today turned out a little quieter than the usual Friday. It was so quiet, in fact, that I decided to pen a few reviews. The Knight Witch, Railbound, and Donut... | Read more »
Blue Archive reveals its latest event st...
Nexon has announced the new update for Blue Archive, under the name of An Unconcealed Heart. Featuring a battle between two academies, the story will follow a group struggling to gain recognition, and will bring three new students to recruit. [... | Read more »
Dead Cells+ Is Out Now on Apple Arcade a...
Following the major update for Dead Cells on iOS and Android a few days ago, Playdigious has brought Dead Cells+ () to Apple Arcade. As an App Store Great, Dead Cells+ includes all prior paid DLC and content updates. It also has exclusive mobile... | Read more »
SwitchArcade Round-Up: ‘Romancing SaGa’,...
Hello gentle readers, and welcome to the SwitchArcade Round-Up for December 1st, 2022. Wow, December. We’re already at the last month of the year? Phew. I have a lot of work to finish in the next few weeks. As for today, we’ve got a little news, a... | Read more »
‘Railbound’ Update Now Available Adding...
One of our favorite puzzlers released this year is Railbound from Afterburn Games, which hit in early September and earned our Game of the Week recognition for being an absolutely ace logic puzzler. The goal is to place rail pieces down in order to... | Read more »
The Seven Deadly Sins: Grand Cross celeb...
Netmarble Corporation has pulled out all the stops to celebrate the 3 and a half year anniversary of The Seven Deadly Sins: Grand Cross. The Grand Cross 3.5th Year Anniversary the Ultimate One, a rather wordy title, brings with it a brand new... | Read more »
‘Skullgirls Mobile’ Major Update 5.2 Out...
Developer Hidden Variable pushed out a major update for Skullgirls Mobile (Free) a few hours ago. The version 5.2 update brings in Black Dahlia (before the console and PC game), Retakes, XP Treats, free gifts, and more. Since launch, Skullgirls... | Read more »
Out Now: ‘Disgaea 4’, ‘Romancing SaGa: M...
Each and every day new mobile games are hitting the App Store, and so each week we put together a big old list of all the best new releases of the past seven days. Back in the day the App Store would showcase the same games for a week, and then... | Read more »

Price Scanner via MacPrices.net

Holiday Sale: Apple AirPods Pro for only $199...
Amazon has new 2022 AirPods Pro in stock and on sale for $199.99 shipped as part of their Holiday sale. Their price is $50 off Apple’s MSRP, equaling their Black Friday price, and it’s the lowest... Read more
New Holiday Sale: Apple retailers are offerin...
Several Apple retailers lowered prices on 10.9″ iPad Airs overnight to lows of $100 off MSRP starting at $499. Their prices are the lowest available for iPad Airs anywhere this Holiday season right... Read more
New Holiday sale at Amazon: Take $50 off Appl...
Amazon has Apple’s new 10th-generation iPads in stock and on sale, for the first time, for $50 off MSRP starting at only $399. Their discount applies to all models and all colors. With the discount,... Read more
Holiday Sale: Get an 8.3″ Apple iPad mini for...
Sams Club has 10.9″ 64GB iPad minis on Holiday sale for $80-$100 off MSRP through December 7, 2022. With their discount, prices start at $399 — the cheapest price for a new iPad mini from any of the... Read more
Sams Club Holiday December Event sale: Apple...
Apple AirPods Max headphones are on sale at Sams Club for $110 off MSRP ($439) as part of their December Event sale, ending on December 7, 2022, valid for all colors. Sale price for online orders... Read more
Apple’s 10.2″ 64GB 9th-generation iPads are o...
Sams Club has 9th-generation 64GB iPads on Holiday sale for $60 off MSRP through December 7, 2022. With their discount, prices start at $259 — the cheapest price for a new iPad from any of the Apple... Read more
11″ 128GB WiFi M2 iPad Pro on sale for $749,...
B&H Photo has the new 11″ 128GB WiFi M2-powered iPad Pro (in Space Gray or Silver) on Holiday sale for $749 including free 1-2 day shipping to most US addresses. Their price is $50 off MSRP and... Read more
Find the best Holiday sale price on an iPad u...
We’ve updated our iPad Price Trackers with the latest information on the new 10th-generation iPads, M2-powered iPad Pros, M1 iPad Airs, iPad minis, and 9th generation iPads from Apple’s authorized... Read more
Apple retailers are offering $100-$150 Holida...
Apple retailers have posted their most-recent Holiday sale prices on 13″ MacBook Airs. Take up to $150 off MSRP on M2-powered Airs with these sales with prices starting at only $1099. Free shipping... Read more
Holiday Sale: Apple’s 14″ MacBook Pros with M...
B&H Photo is offering $200-$300 discounts on Apple’s 14″ MacBook Pros with M1 Pro CPUs as part of their Holiday 2022 sale, with prices starting at $1799. Free 1-2 day shipping is available to... Read more

Jobs Board

Support Technician II - *Apple* Support - O...
…problems and acting as a liaison between customers and resolving groups. As an Apple Technical Specialist, you will be supporting many of our popular Apple Read more
*Apple* Electronic Repair Technician - PlanI...
…a highly motivated individual to join our Production Department as an Apple Electronic Repair Technician. The computer repair technician will diagnose, assemble, Read more
Lead Developer - *Apple* tvOS - Rumble (Uni...
…earnings, and positive sentiment About the role: We are looking for a Lead Apple tvOS Developer to join our application engineering team to expand our video centric Read more
Tier 1 Endpoint Engineer - *Apple* - Red Ri...
…Desk on site, at our Client's location, with a focus on support to Apple products. This position will handle technical support requests directly from customers and Read more
Product Manager II - *Apple* - DISH (United...
…you will be doing We seek an ambitious, data-driven thinker to assist the Apple Product Development team as our new Retail Wireless division continues to grow and Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.