Slashdot Mirror
Boredom Chasers?
yuggler asks: "Ever found yourself in a boring meeting, class or lecture? Sure! Does anyone know of something to do to make time fly? I feel that somekind of simple game, at the most requiring paper and pen would be the ultimate soultion. So, my question to you is: Does anoyone know of a game with childishly easy rules, yet with a depth that can keep the player(s) spellbound for a small eternity?
An excellent example of what I'm trying to describe is the game Sprouts which only takes 30 seconds to learn, but will take a good portion of your meetings to fully understand. I am currently being tormented in a Swedish highschool, and feel in desperate need of something to get me through classes like Swedish, and Chemistry, while waiting for the programming and technology-classes."
This article is boring.
... I take a laptop to meetings and read /. Really!
Actually
---
http://slashdot.org/moderation.shtml
Looks interesting
Forget the "if", that does happen to me
One of our managers doesn't believe in fun.
---
http://slashdot.org/moderation.shtml
Get a ti calculator like a ti86 or ti89. I got the link cable for the computer and downloaded tons of games for my ti86. Tetris was the most played game. nd it was really easy to play games in math class ;)
You can get games such as tetris, mario bros, galazian, othello, defender, boulder dash, and so many others all clones of course. Try to get the ones written in assembly (not ti basic) because they run fast.
"You can kill a man, but you can't kill what he stands for. Not unless you first break his spirit."-Smoking man,X-Files
I can usually fight off boredom by thinking critically about the topics being covered. Then when I feel myself getting bored, I start to think of good points to raise or questions to ask. If those tactics don't work out, I recommend reading Flow : The Psychology of Optimal Experience, by Mihaly Csikszentmihalyi (Amazon)
...all I had was a piece of string and a stick!
Step 1. Buy Handspring Visor or Palm Pilot
Step 2. Download and sync Chessgenius
Step 3. Enjoy
If you have another player, or you're able to play two player games by yourself, 3D Tic-Tac_Toe is a relatively entertaining game. Increase it from a 3x3x3 grid to a 5x5x3 grid and you'll be busy for a while.
This space for rent.
Sounds like your priorities are a little skewed. You may not feel that you need to pay attention in certain classes, but the skills learned will come in handy. Just wait till you get into the real world and you have to sit through long boring meetings. Knowing how to pay attention will really come in handy. Especially when someone unexpectadely asks you a question!
-> Capt Cosmic <-
Someone else mentioned a calculator, and it's a good idea, there are tons of games for HP calculators and some of those are really time-consuming. I had a platform game where the main character was an ant, i was playing that in vectorial calculus when a classmate commented the ant looked like a lump of shit. I started laughing so hard, that the teacher noticed, and i nearly got kicked out of the class. That, of course, would have been more entertaining than remaining in class, but would have hampered my graduation aspirations.
No, seriously, perhaps you should try and focus on the class instead of publicizing your need to kill time? plus it's going to be pretty embarrassing when you get asked a question and can't reply because you've been busy playing a game. Yes, i can picture that: "hold on a second, professor, i'm trying to pass level 8 here.."
First of all:
/point finale/. Lectures in general, IMO, are rather pointless exercises in pseudo-education. For me at least, with a topic of anything more than nominal complexity, a textbook is invaluable while lectures, put simply, are a waste of time. I'm surprised that slashdot has turned up so many droids-in-training! Seriously, though. My suspicion is that people like the psychological kick in the ass associated with waking up early,going to class, etc.; it makes them feel as though they're sacrificing something to 'learn', and therefore that they have more to lose by slacking, and therefore they'll study harder on their homework, and therefore do better, and therfore attribute this to going to class, therefore, they go to more class, and the current educational model perpetuates itself. ( The model, I believe, is analogous to that used by many major religions to maintain piousness: Show up at place X at time Y every N days and you're saved! ) So long as you're disciplined enough to focus on the time on the homework w/o the psychological guilt-crutch, then you can skip almost unlimited amounts of time.
;) You can write the rules to the game in about four instructions, and it can be played on any size of board or grid. Better still, each individual piece is never moved after being placed on the board (until removed -- which doesn't happen frequently enough to be annoying (unless the pieces are your own ;) ) ), which means that 'Go: Napkin Edition' can be played whenever you have a pencil handy.
* Paying attention in class is not necessarily necessary, especially if you already know the subject,
But whatever works for you...
* And as for your actual problem: Learn Go. (aka 'Wei Chi', which certainly yields more relevant hits in Google
Oh, did I mention that the gameplay requires more thought than Chess? And that GNU-based Go servers and clients are available at all over the known Internet, as well as (passable) AI oppoents?
Okay, so it's two players... but once you get good, you'll want to practice constantly, and it's the sort of game conducive to experimentation and situation-analysis. In particular, books of Go problems are quite fun... take a look at one of the problems, and go to your lecture. By the time lecture is over, you just might have solved it.
- undoware.ca
I sit with my Palm (A Sony Clie). If the meeting or class or lecture is big enough, no one notices. I play solitare, easy but always engaging. Space Trader is also quite good. They are simple, and allow you to jump back into what the group is doing easily if necessary. I do this mostly in my Intro C++ class (a real joke), but in other places also.
The link to sprouts mentioned in the original query seems to have an error in attribution.
Take a look at: http://www.sciencenews.org/sn_arc97/4_5_97/mathla
There's a bunch more info on game play, theory, and mathematical background on the game at that link, as well as this link: http://www.forum.swarthmore.edu/news.archives/geom etry.research/article399.html to a strategy by John Conway on a strategy for game play.
As an aside, I knew a guy at RPI who in 1981 or so wrote a program to play the game and graphically display the results... if you wanted it to, it would show all the possibilities as it tried different moves, too! Pretty amazing feat considering the capabilities of the computers we had available at the time.
My advice would be to pay attention and try to get what you can out of school. There is more to life than just computers and awesome and fun as they are, I'm glad I can speak somewhat intelligently to others about different topics. It is good to be well-rounded and to speak your language well. Everything you learn is what comprises who you are, in my opinion. Do you want to just be a techno geek, or do you want to be a techno geek who understands wonderful literature (great for talkin' with the ladies--hint, hint), knows what elements are used in fashioning chips, who can discuss current events, etc.
Believe me, I have had regrets so many times for having the attitude you're expressing because I would like to know more about what I thought was a "waste of time". That's just some advice from a boring old 30 year old. If only I had listened to similar advice!!!
Zed's dead baby. Zed's dead.
I've spent hours and hours in highschool playing chess with a friend sitting next to me. It does require a paper, a pencil and an eraser rather than just a paper and a pen, though.
- Tal Cohen
My friends play Pente in class all the time. It is a bit like Go. The rules are simple but strategy can get very complex. Here is a simple explanation.
My solution is to get a Palm and play Patience, but that's beside the point.
"This message is composed of 100% recycled electrons."
dopewars is the king.
Its available on almost any platform - tiCalc, hpCalc... palm, psion anything.
Its bloody addictive too...
Dude, I'm in math grad school, and writing or designing C++ projects is a wonderfull time- killer during boring classes. Of course, I could just skip class, but I'd feel guilty if I skipped ALL of them. ALso, if you have some long-distance friends, you could write them letters. Time flies when I write letters. Also, I always take my bills and checkbook, etc.., to class when they pile up, but you might be too young for this. My favorite, though, is to work on a hard-ass math problem during class (unrelated to what the prof is discussing). I do my best work during boring classes. And I'm totally serious.
Paying attention in class: Only about 1% of eveything I know came from lectures, and half of that is that lectures are dumb. How can you learn anything when you're half asleep? Memorization and regurgitaion BAD! Boredom: During my high school electronics class, my friends and I played AD&D using a system of hand signals. Two problems: You need plenty of people to play; dice rolling can be kinda tricky, and the 'dropped my pen' excuse only works so many times.
Another simple game. Can be played verbally or written on paper if silence is needed, or email if distance is a problem.
First person {says|writes|emails} "Tree". Second person does "Fluid". First person does "Tree". Second person goes "Fluid". And so on.
Until someone says "Sap!" at which point they are declared the winner.
Of course you could win every round by just saying "Sap!" first time, but that would be boring. The skill is saying "Sap!" on the go before your opponent wants to say it, thus causing the maximum amount of annoyance to them! It is very rewarding to get through about ten echoes of 'Tree - Fluid' and then hit 'Sap!' and have the other person go "I WAS JUST GONNA SAY IT!!!". Ahh, satisfaction. Similarly there is great pain in being 'Sapped' just as you are about to say it.
When played face-to-face there can be a lot of psychology and body-language involved. Look for any sign of hesitation in your opponent, that's normally a sign of an impending 'Sap'. Have no mercy, hit back straightaway.
Strangely I cant find any web sites devoted to Tree-Fluid...
Baz
To make it a challenge for yourself, remember that classical origami does not allow for tearing ,cutting, or using flat surfaces to get a good crease! Once you pick up the paper, it doesn't leave your hands until your creation is complete. And the no tearing rule makes it particularly challenging because most patterns want a square piece of paper, and most of the paper you'll encounter in the wild isn't square. Folding cranes out of business cards without tearing off the extra bit is a particular hobby I enjoy because with the thicker paper it's hard to get the head to come out right.
If you're really bored with that, and you want to play some tricks on your teachers, you can search around the net for some "adult" origami patterns to fold and leave on other people's desks.
www.HearMySoulSpeak.com
If you're in Sweden, isn't there some hot Swedish girl nearby you can stare at during the class?
n/t
mmmmmm.....open sauce
This might not be that great in a graph theory class since most of what you need to master this game is being taught.
there are (or at least there were, last time I checked) some unsolved problems in graph theory that can be attacked with pencil and paper.
Make a planar (in 2-d and no edges cross each other) graph where each node has no more than three connections. Each node also has to be no more than three hops from any other node. Can you get more than twelve nodes? Can you prove that nobody else can, either?
I have scribbled away many an intriguing hour playing with this.
Liberty uber alles.
Although everyone so far has answered the question in terms of being bored in class, it's usually much more of a problem in meetings, where attendance is often mandatory and content often entirely lacking.
Fortunately, meetings provide the perfect setting for playing buzzword bingo, which can be played alone or in groups.
But my grandest creation, as history will tell,
Was Firefrorefiddle, the Fiend of the Fell.
Ahh, the many hours of meetings that I've spent folding paper. I did, however, tend to get in trouble for folding paper during middle and high school.
For some serious challenges, try memorizing more complicated models like Kawasaki's rose. (diagram) (makes a nice tip, too. the rose in Origami for the Connoisseur is easier to learn...) Or learn to make modular origami stuff (origami that uses multiple units that are [generally] all the same). (instructions)
A great place to start is Joseph Wu's Origami Page.
The myth that a thousand paper cranes will bring good luck and health is much older than Sadako's story, although she did try to fold 1,000 while she was sick with leukemia. She finished 644 before she died, and her classmates completed the rest. There are two books about her story: Sadoko and the Thousand Paper Cranes and Child of the Paper Crane .
It's also not true that "classical" origami is extremely restrictive. Most of the rules mentioned were added by outsiders. There are many very old designs (such as connected cranes) that require cutting. It is an interesting challenge to follow those kinds of restrictive rules, but they are not really requirments with a long history.
The Origami FYI covers these and many other interesting points.
fnord
If you sit at the back, get you and your buddies to each select a 'keener' - ie, a student who is known for asking inane, overly complicated questions in order to demonstrate their attentiveness, interest, and intellect at the expense of about 50 students to who just want to learn the material in under an hour.
At any rate, each time your selected keener raises their hand, you get a letter; the goal, of course, is to spell bingo. You will be amazed at how attached you will become to your keener of choice.
"Old man yells at systemd"
Actually, I'm not sure if I'm joking.
Come on, give it up, that's
When I got really bored in class, this is what I used to do. Draw out an 8x8 grid and pencil in step numbers in each square starting anywhere, and moving around the board with valid chess knight moves. The objective is to hit every square exactly once.
Its not too tough, but it requires a bit of planning to get it right, and it keeps your mind occupied for a while.
-Restil
Play with my webcams and lights here
Wow! Great riddle! The answer is 22. Here's the proof (this is a full hour's worth of work): First, we find how many nodes you can theoretically connect to. Let's define a(n,i) to be the number of unique nodes accessible from node n with path maximum length i. Trivially, we can observe: a(n,0)=1 // Contains only n
a(n,1)=4 // n's three children and itself.
Now, by observing the propogation of children in this manner, we can derive this recursive function:
a(n,i)=(a(n,i-1)-a(n,i-2))*2 + a(n,i-1))
This yields:
a(n,0)=1
a(n,1)=4
a(n,2)=10
a(n,3)=22
Although we can probably show this function is true for all i>=2, I think it is sufficient to prove that is true at i=3.
Draw a node with three children. Now draw two children for each child (already has one connection to parrent). Now do this again. You'll notice it's 22.
Thus we establish that the theoretical maximum number of nodes that can be connected to any given node by 3 hops is 22.
Now we need to prove that there exists a largest web of (22) nodes for which each node is connected by three or fewer hops to every other node. We prove this by example.
Draw 22 nodes in a circle. Pick a node arbitrarily and label it 0. We will call this the level 0 node. Now draw three lines to other nodes and label those level 1 nodes. Now, for each level 1 node, draw TWO lines to other unconnected nodes. Label these level 2 nodes. Now, draw two lines from each level 2 node to unconnected nodes. Label these level 3 nodes.
By now, all nodes should be connected by three or fewer hops to the level 0 node. Note that all nodes belonging to levels 0-2 have three connections, and all level 3 nodes have only one.
This part gets tricky. Label the level one nodes a, b, and c. Group and circle each level 2 node with its level 3 children. Each level 1 node should be connected to two of these groupings, which you should label a1, a2, b1, b2, c1, and c2.
For both a1 and a2, connect one level 3 node to a level 3 node in b1 and c1, and the other to b2 and c2. Do not refer to the same external node twice! Level 3 nodes in a1 and a2 should not be connected by any lengths shorter than four except via their level 1 grandparent. At this point, both our level 0 node AND our level 1 node "a" are connected by three or fewer hops to each other node.
Repeat the above for the b1, b2 groups, excluding paths already drawn. Once this is complete, you have a largest (22 node) web as described above.
To complete the proof, here is the example I drew, with 22 nodes {1,2,...22}:
1->2,12,22
2->1,3,17
3->2,4,5
4->3,9,20
5->3,6,14
6->5,8,9
7->8,14,16
8->6,7,22
9->4,6,11
10->11,18,20
11->9,10,12
12->1,11,13
13->12,14,15
14->5,7,13
15->13,16,19
16->7,15,17
17->2,16,18
18->10,17,19
19->15,18,21
20->4,10,21
21->19,20,22
22->1,8,21
QED
-- Hal
My heartiest apologies. I should learn HTML.
(NT)
...the tricky part is that it has to be planar.
which means that you have to be able to draw it out on a piece of paper without any of the lines crossing.
But, don't be discouraged--it was fun to solve the problem that you did, right?
I have worked on it for a while, keeping a list of "forbidden subgraphs", but I keep losing track of the work. Still, it's fun, and you can spend a lot of time (at least with my approach).
What I am doing with it is starting with the maximal circuit (I don't know the terminology--the biggest loop in it that isn't directly short circuited) and the maximal one connected to that.
Or something like that. LIke, draw a 4-sided figure with a triangle on top and see if you can stay planar, starting from there, and exceed 12 nodes. I think I might have proved (by tedious lists of drawings) that you can't, but I don't remember which ones i finished.
Somewhere in this process you may end up with some clever insight into the problem. I don't think I have yet, but I do seem to remember something...
Oh well, getting old.
later
Liberty uber alles.
Wow. Messed up on that count. But I am determined! Hmm... no how to keep track of inaccessible nodes...
If you had drawn a numbered circle of 12 nodes with 1 at the top and 7 at the bottom:
2->6 (internal path), 12->8 (internal), 3->11 (external), and 5->9 (external).
I cannot devise any other figure that works, and I cannot add to it. I like to think of the internal paths as "highways" and the external paths as "bypasses." One observation I made is that each node has within one hop either two highways, two bypasses, or one of each.
If it can be proven that this is a requirement in order to have all nodes within three hops, we can show that +12 node graphs are impossible, since extending the graph at any point would keep at least one node from being able to reach two of the "special" paths, thus keeping at least one other node from being able to reach it.
What do you think?