it's hard to be organized when you have so little space

[kodalai]

Does anyone know that game you play where you have three pegs, and a bunch of rings on the pegs, and you have to move the rings one at a time to another peg, and you aren't allowed to put a bigger ring on top of a smaller ring?

Yeah.

That's the game I play with my binders and my available desk space. -_-;

Comments

[titlecharacter.livejournal.com]

The Towers of Hanoi?

[kodalai.livejournal.com]

Yeah, if that's what it's called.

[ayelle.livejournal.com]

We used to play a version of that called "Layer Cake" on the computer when we were small.

[kodalai.livejournal.com]

I know! And if you put a big layer on top of a little layer it would squash it flat. I was never very good at that game.

That game was actually what I was thinking of when making the comparison. I didn't know about the ring game till I was over.

[(Anonymous)]

Now see, that was just a silly age marketing thing. Or maybe what the Right called Vietnam Syndrome. They assumed you, the player, would rather assemble an intact cake than be part of an elite strike force rearranging the architecture of Hanoi. Liberal wimps. Today you'd probably call it Towers of Baghdad, and the object would be smashing them flat.

If you want to exercise your brain (obviously the curriculum doesn't!), try to figure out why the minimum number of moves for n rings is always 2^n - 1. (Sorry, the repressed math teacher temporarily ran amok.)

GWB

[kodalai.livejournal.com]

Now see, that was just a silly age marketing thing.

I'll take your word for it?

try to figure out why the minimum number of moves for n rings is always 2^n - 1.

I might, but I really have no idea what you mean by "why" in this context. It does because it does. O_o

[thefeifei.livejournal.com]

It does because it does. O_o

*tried that on a couple 'o math tests*

X3

[darksea.livejournal.com]

[start=math]
The average tower of Hanoi is eight layers (although the legend that deals with the end of the world has 64), yes? So let's do, say, the first four or so.

To move one disk takes one move. 2^1 - 1 = 1
To move two disks takes three moves (U from 1 to 3, L from 1 to 2, U from 3 to 2). 2^2 - 1 = 3
To move three disks takes seven moves, because you move the top two disks, then the bottom one, and then the first two again. 2^3 -1 = 7
To move four disks takes fifteen moves, becase you have to move the top three disks (7 moves) then the bottom one (1 move), then the first three again (another 7 moves). 2^4 - 1 = 15

In other words, 2^n - 1 is the sum of the series 2(n-1) + 1.
[end=math]

How's that? According to the legend, the universe lasts 2^64 - 1 seconds. Your binders aren't that bad, are they?

[kodalai.livejournal.com]

I'll have to take your word for it on how many moves it takes to move X amount of disks. It's been so long since I actually played the game. ^^;

Your binders aren't that bad, are they?

No, although some days it does seem like certain important documents have vanished into a singularity. XP