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

OmniOutliner Pro 5.8.5 - Pro version of...
OmniOutliner Pro is a flexible program for creating, collecting, and organizing information. Give your creativity a kick start by using an application that's actually designed to help you think. It's... Read more
OmniOutliner Essentials 5.8.5 - Organize...
OmniOutliner Essentials (was OmniOutliner) is a flexible program for creating, collecting, and organizing information. Give your creativity a kick start by using an application that's actually... Read more
Quicken 6.3.0 - Complete personal financ...
Quicken makes managing your money easier than ever. Whether paying bills, upgrading from Windows, enjoying more reliable downloads, or getting expert product help, Quicken's new and improved features... Read more
Viber 15.8.0 - Send messages and make fr...
Viber lets you send free messages and make free calls to other Viber users, on any device and network, in any country! Viber syncs your contacts, messages and call history with your mobile device, so... Read more
Butler 4.4.2 - Hot key, menu, and keywor...
Butler makes it easier for you to perform a wide variety of potentially recurring tasks. Just arrange these tasks in Butler's fully customizable configuration and assign one or more triggers to a... Read more
GIMP 2.10.24 - Powerful, free image edit...
GIMP is a multi-platform photo manipulation tool. GIMP is an acronym for GNU Image Manipulation Program. The GIMP is suitable for a variety of image manipulation tasks, including photo retouching,... Read more
ScreenFlow 10.0.3 - Create screen record...
ScreenFlow is powerful, easy-to-use screencasting software for the Mac. With ScreenFlow you can record the contents of your entire monitor while also capturing your video camera, microphone and your... Read more
Notability 10.4.5 - Note-taking and anno...
Notability is a powerful note-taker to annotate documents, sketch ideas, record lectures, take notes and more. It combines, typing, handwriting, audio recording, and photos so you can create notes... Read more
Day One 6.7 - Maintain a daily journal.
Day One is an easy, great-looking way to use a journal / diary / text-logging application. Day One is well designed and extremely focused to encourage you to write more through quick Menu Bar entry,... Read more
Vallum 4.0.3 - $15.00
Vallum is a little tool that helps you monitor and block apps connections and throttle apps bandwidth. It is able to intercept connections at the application layer, and hold them while you decide... Read more

Latest Forum Discussions

See All

The 5 Best Mobile Stealth Action Games
Action games are a hard sell on mobile, and they get even harder if the more precision they require. Stealth games are one such subgenre that just doesn’t feel like it could work well on small touchscreens where you’re prone to being distracted or... | Read more »
Exos Heroes' latest update introduc...
LINE Games has announced that several pieces of content in their popular RPG, Exos Heroes, have received changes to celebrate the summer season. There is also a new story event to tackle called Memorial Saga that follows Ramge, the Prince of North... | Read more »
Infinity Island is a cutesy idle game fr...
Infinity Island is a brand new idle game from Luca Redwood that is available now for iOS and Android. You might be familiar with Redwood from their previous games, 10000000, You Must Build A Boat and Photographs. [Read more] | Read more »
Infinite Galaxy is a deep sci-fi strateg...
The collapse of the Empire is nigh. In its wake, remnants of the epic intergalactic struggle float through the debris in space, as lawless pirates sow seeds of discord and loyalist groups strike terror into the hearts of innocent civilians. In the... | Read more »
Injustice 2 Mobile's latest update...
Warner Bros Games and NetherRealm Studios have released a major update for their fighting game, Injustice Mobile 2. It sees the arrival of a brand new character, Vixen, to the game alongside changes to the existing progression system. [Read more] | Read more »
Pokemon Go's August events have bee...
Following Pokemon Go Fest 2021, it's time to look ahead to August and the events that will take place in Niantic's AR game throughout the month. There's a new Research Breakthrough encounter, 1 PokeCoin bundles and a bunch more. [Read more] | Read more »
Overboard!, Inkle's reverse whodunn...
Inkle's fresh approach on the whodunnit mystery genre, Overboard! is now available for Android devices followings its release on iOS. The game has received predominately positive reviews since it launched. It holds a healthy Metacritic score... | Read more »
There's never been a better time to...
We were obviously big fans of Genshin Impact when it launched last year, so much so that it grabbed our Game of the Year award. Since that time, though, the game (and our enthusiasm fo it) had gone somewhat quiet. [Read more] | Read more »
Homeworld Mobile's first regional b...
Since the initial announcement all the way back in 2019, we've not heard an awful lot about Homeworld Mobile. But now, there appears to be some movement as the game's first regional beta test is now live. [Read more] | Read more »
Masketeers: Idle Has Fallen's impen...
Appxplore has announced that their popular RPG Masketeers: Idle Has Fallen will soon receive a major update that introduces a Guild system alongside another feature called Sigils. The developers hope this will add more excitement to the game by... | Read more »

Price Scanner via MacPrices.net

Verizon offers $200 discount on new Apple M1...
Verizon will take up to $200 off the price of an M1-powered Cellular iPad Pro with select trade-in and monthly payment plan (24 months). The fine print: “Less $100 promo credit applied to account... Read more
Record low prices on Apple’s 13″ M1 MacBook A...
Amazon is offering a $150 discount on Apple’s 13″ M1 MacBook Airs with 7-Core GPUs and 8-Core CPU. With Amazon’s discount, their price drops to only $849 with free shipping. Their prices are the... Read more
Save up to $140 on an M1 Mac mini at Apple wi...
Apple has a full line of standard configuration M1 Mac minis available in their Certified Refurbished section starting at only $589 and up to $140 off MSRP. Each mini comes with Apple’s one-year... Read more
Here are the details of Apple’s sales tax hol...
Apple is participating in the 2021 sales tax holiday again this year. In certain states on certain days customers are eligible to save on the sales tax for items purchased on Apple’s online store.... Read more
Apple has 13″ M1 MacBook Pros available for $...
Apple has a full line of 2020 13″ M1 MacBook Pros available Certified Refurbished, starting at only $1099 and up to $230 off original MSRP. These are the cheapest M1 MacBook Pros for sale today at... Read more
Our exclusive Apple Price Trackers help you f...
Our Apple award-winning price trackers are the best place to look for the lowest prices and latest sales on all the latest Apple gear. Scan our price trackers for the latest information on sales,... Read more
The best deal on 13″ M1 MacBook Airs are thes...
Apple has a full line of 2020 13″ M1 MacBook Airs available, Certified Refurbished, starting at only $849 and up to $190 off original MSRP. These are the cheapest M1 MacBook Airs for sale today at... Read more
Reminder: Take advantage of Apple’s Back to S...
Take advantage of Apple’s Back to School promotion for 2021. As part of this promotion, Apple will include one free pair AirPods (with charging case) with the purchase of a MacBook Air, MacBook Pro,... Read more
Sunday Sale: Amazon is offering record-low pr...
Amazon has Apple’s entire MacBook lineup on sale today for record low prices, with models available starting at $899 and up to $500 off Apple’s MSRP. Shipping is free. These are the same MacBook Pros... Read more
Sunday Sale: Apple Pencil 2 for only $99, sav...
Amazon has the Apple Pencil 2 on sale today for only $99 shipped. Their price is $30 off Apple’s MSRP, and it’s the lowest price available for an Apple Pencil 2 anywhere. For the latest prices and... Read more

Jobs Board

*Apple* Support Specialist - Robert Half Tec...
…organization in Lawrenceville, New Jersey is in need of a highly experienced Apple Support Specialist! The Apple Support Specialist will be responsible for Read more
Geek Squad *Apple* Consultation Professiona...
**818649BR** **Job Title:** Geek Squad Apple Consultation Professional **Job Category:** Store Associates **Store Number or Department:** 001045-Mountain View-Store Read more
Head of *Apple* Product Development - DISH...
…the potential to power a connected world. What you'll be doing As the Apple Product Development lead, you will make strong contributions to the product and feature Read more
Medical Assistant (CMA, RMA, LPN) - *Apple*...
…Health Fairview has an immediate opening for a Medical Assistant/LPN at the M Health Fairview Apple Valley Clinic located in Apple Valley, MN. This is a 1.0 FTE Read more
Geek Squad *Apple* Consultation Professiona...
**818139BR** **Job Title:** Geek Squad Apple Consultation Professional **Job Category:** Store Associates **Store Number or Department:** 000535-Portsmouth-Store Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.