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

Spotify 1.0.36.124. - Stream music, crea...
Spotify is a streaming music service that gives you on-demand access to millions of songs. Whether you like driving rock, silky R&B, or grandiose classical music, Spotify's massive catalogue puts... Read more
Firefox 48.0.2 - 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
BBEdit 11.6.1 - Powerful text and HTML e...
BBEdit is the leading professional HTML and text editor for the Mac. Specifically crafted in response to the needs of Web authors and software developers, this award-winning product provides a... Read more
OmniGraffle Pro 6.6.1 - Create diagrams,...
OmniGraffle Pro helps you draw beautiful diagrams, family trees, flow charts, org charts, layouts, and (mathematically speaking) any other directed or non-directed graphs. We've had people use... Read more
OmniGraffle 6.6.1 - Create diagrams, flo...
OmniGraffle helps you draw beautiful diagrams, family trees, flow charts, org charts, layouts, and (mathematically speaking) any other directed or non-directed graphs. We've had people use Graffle to... Read more
Dropbox 8.4.21 - Cloud backup and synchr...
Dropbox is an application that creates a special Finder folder that automatically syncs online and between your computers. It allows you to both backup files and keep them up-to-date between systems... Read more
BetterTouchTool 1.84 - Customize Multi-T...
BetterTouchTool adds many new, fully customizable gestures to the Magic Mouse, Multi-Touch MacBook trackpad, and Magic Trackpad. These gestures are customizable: Magic Mouse: Pinch in / out (zoom... Read more
ScreenFlow 6.1 - Create screen recording...
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
f.lux 37.7 - Adjusts the color of your d...
f.lux makes the color of your computer's display adapt to the time of day, warm at night and like sunlight during the day. Ever notice how people texting at night have that eerie blue glow? Or wake... Read more
BetterTouchTool 1.84 - Customize Multi-T...
BetterTouchTool adds many new, fully customizable gestures to the Magic Mouse, Multi-Touch MacBook trackpad, and Magic Trackpad. These gestures are customizable: Magic Mouse: Pinch in / out (zoom... Read more

Become the King of Avalon in FunPlus’ la...
King Arthur is dead. Considering the legend dates back to the 5th century, it would be surprising if he wasn’t. But in the context of real-time MMO game King of Avalon: Dragon Warfare, Arthur’s death plunges the kingdom into chaos. Evil sorceress... | Read more »
Nightgate (Games)
Nightgate 1.0 Device: iOS Universal Category: Games Price: $2.99, Version: 1.0 (iTunes) Description: *** Launch Sale: 25% OFF for a limited time! *** In the year 2398, after a great war, a network of intelligent computers known as... | Read more »
3 best fantasy football apps to get you...
Last season didn't go the way you wanted it to in fantasy football. You were super happy following your drafts or auctions, convinced you had outsmarted everyone. You were all set to hustle on the waiver wire, work out some sweet trades, and make... | Read more »
Pokemon GO update: Take me to your leade...
The Team Leaders in Pokemon GO have had it pretty easy up until now. They show up when players reach level 5, make their cases for joining their respective teams, and that's pretty much it. Light work, as Floyd Mayweather might say. [Read more] | Read more »
Ruismaker FM (Music)
Ruismaker FM 1.0 Device: iOS Universal Category: Music Price: $4.99, Version: 1.0 (iTunes) Description: Following up on the success of Ruismaker, here's her crazy twin-sister, designed for people who want to design their own... | Read more »
Space Marshals 2 (Games)
Space Marshals 2 1.0.15 Device: iOS iPhone Category: Games Price: $5.99, Version: 1.0.15 (iTunes) Description: The sci-fi wild west adventure in outer space continues with Space Marshals 2. This tactical top-down shooter puts you in... | Read more »
Dungeon Warfare (Games)
Dungeon Warfare 1.0 Device: iOS Universal Category: Games Price: $3.99, Version: 1.0 (iTunes) Description: Dungeon Warfare is a challenging tower defense game where you become a dungeon lord to defend your dungeon against greedy... | Read more »
Solitairica (Games)
Solitairica 1.0.7 Device: iOS Universal Category: Games Price: $3.99, Version: 1.0.7 (iTunes) Description: Solitairica takes RPG combat and challenging rogue-like progression to a fresh new place—the world of solitaire! | Read more »
Bowmasters tips, tricks and hints
At least for this writer, archery was one of the more pleasant surprises of the 2016 Rio Olympics. As opposed to target shooting with guns, which was dreadfully boring, watching people shoot arrows at targets was pretty darn cool. [Read more] | Read more »
Best apps for watching live TV
The Olympics have come and gone, leaving nearly everyone in a temporary state of "What the heck am I going to watch on TV right now?" Besides old reruns of Golden Girls, but that goes without saying. [Read more] | Read more »

Price Scanner via MacPrices.net

BookBook Releases SurfacePad, BookBook &...
BookBook has released three new covers just for iPad Pro: SurfacePad, BookBook and BookBook Rutledge Edition. BookBook for iPad Pro is a gorgeous leather case reminiscent of a vintage sketchbook.... Read more
Clean Text 1.0 for iOS Reduces Text Cleanup a...
Apimac today announced availability of Clean Text for iOS, a tool for webmasters, graphic designers, developers and magazine editors to reduce text cleanup and editing time, and also for any iPhone... Read more
27-inch iMacs on sale for up to $220 off MSRP
B&H Photo has 27″ Apple iMacs on sale for up to $200 off MSRP including free shipping plus NY sales tax only: - 27″ 3.3GHz iMac 5K: $2099 $200 off MSRP - 27″ 3.2GHz/1TB Fusion iMac 5K: $1899 $100... Read more
Apple refurbished 13-inch MacBook Airs availa...
Apple has Certified Refurbished 2016 and 2015 13″ MacBook Airs now available starting at $849. An Apple one-year warranty is included with each MacBook, and shipping is free: - 2016 13″ 1.6GHz/8GB/... Read more
Apple refurbished iPad mini 2s available for...
Apple is offering Certified Refurbished iPad mini 2s for up to $80 off the cost of new minis. An Apple one-year warranty is included with each model, and shipping is free: - 16GB iPad mini 2 WiFi: $... Read more
Save up to $600 with Apple refurbished Mac Pr...
Apple has Certified Refurbished Mac Pros available for up to $600 off the cost of new models. An Apple one-year warranty is included with each Mac Pro, and shipping is free. The following... Read more
Mac Pros on sale for $200 off MSRP
B&H Photo has Mac Pros on sale for $200 off MSRP. Shipping is free, and B&H charges sales tax in NY only: - 3.7GHz 4-core Mac Pro: $2799, $200 off MSRP - 3.5GHz 6-core Mac Pro: $3799, $200... Read more
Will We See A 10.5″ iPad Pro in 2017? – The ‘...
A MacRumors report, cites a research note from KGI Securities analyst Ming-Chi Kuo, saying a new size iPad model is in the works. According to the highly respected Cho, who has a strong track record... Read more
IOGEAR USB-C Docking Station Transforms Lapto...
IOGEAR has announced the launch of its innovative USB-C Docking Station with Power Delivery which turns USB-C enabled laptops into desktop workstations. The new IOGEAR USB-C Docking Station features... Read more
12-inch Retina MacBooks on sale for up to $10...
Amazon has 2016 12″ Apple Retina MacBooks on sale for $100 off MSRP. Shipping is free: - 12″ 1.1GHz Space Gray Retina MacBook: $1199 $100 off MSRP - 12″ 1.1GHz Silver Retina MacBook: $1224.99 $75 off... Read more

Jobs Board

*Apple* Professional Learning Specialist - A...
# Apple Professional Learning Specialist Job Number: 51234243 Portland, Maine, Maine, United States Posted: Aug. 18, 2016 Weekly Hours: 40.00 **Job Summary** The Read more
*Apple* Mobile Master - Best Buy (United Sta...
What does a Best Buy Apple Mobile Master do? At Best Buy, our mission is to leverage the unique talents and passions of our employees to inspire, delight, and enrich Read more
*Apple* Retail - Multiple Positions Akron, O...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
Simply Mac *Apple* Specialist- Repair Techn...
…The Technician is a master at working with our customers to diagnose and repair Apple devices in a manner that exceeds the expectations set forth by Apple Read more
*Apple* Retail - Multiple Positions Germanto...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.