10001110100110101
So I'm here. Laz and I played Diablo 2 last night for a couple of hours. We played hard core so being careful was the name of the game. It was actually quite fun, although we didn't really get to play all that long. (Come on, a couple of hours? That's nothing!)
[0 Comments]
Hmm.. seems like a number of updates up there, including Laz, KGL, and Jax.
Man, I have to respond to this e-mail. Especially the one from the person who was supposed to go to Ottawa! (I'll get to it, really I will!)
<- pleading for forgiveness.
[0 Comments]
We went outside to eat lunch, and I brought out the disc hoping that my injury won't take too much out of the enjoyment of throwing it around. RHS was pretty good at aiming it at me, so I didn't have to hop around too much, and the wind was basically non-existent, so we had a pretty good throw for a while there. Hopefully my foot will heal soon so I can start practicing jumps and stuff..
[0 Comments]
In light of Growly's (seemingly) insatiable desire for more teasers and puzzles, I came across this interesting question while sifting through old Putnum questions.
A game starts with four heaps of beans, containing 3, 4, 5 and 6 beans. The two players move alternately. A move consists of taking either
- one bean from a heap, provided at least two beans are left behind in that heap, or
- a complete heap of two or three beans.
The player who takes the last heap wins. To win the game, do you want to move first or second? Give a winning strategy.
I haven't solved this one myself, so you guys may want to try it out for yourselves.
There's a great puzzle that HKL sent me a few years ago, but I can't remember exactly how it went, and I only vaguely remember the solution. It's the sum-product question. I'll see if I can rederive it.
I fixed up the problem above. I had a couple of typos that Laz noticed. (You know the problem with the mind thinking one thing and the fingers typing another..)
[0 Comments]
I found a link which has the sum-product puzzle that I was talking about before. Actually, it has a whole list of sum-product puzzles, but the one I was thinking of I have reproduced below:
An Approximate Version of The S & P Puzzle.
Three people, S, P, and the Settor, are in a room together, and can hear each other, are perfect reasoners, etc.
The Settor thinks up two numbers between 2 and 99 inclusive.
He tells the sum to S, and the product to P.
He asks S "What are the two numbers?" S replies "I don't know."
He asks P "What are the two numbers?" P replies "I don't know."
At this point, S says "Now I know!"
And then P says "Now I know!"What are the two numbers?
Now, I don't know if there's a solution to this version of the problem, I thought I had one, but then again, I'm not sure if this was the way the problem was stated! HKL may be able to say more about this.
[0 Comments]
I've finally combined my two journal scripts into one, and I'll be going through the process of cleaning up the code. Until then, if there are any problems, then give me a shout. I haven't tested this thing out for any bugs yet.. *eyes script warily*
Anyway, I have to go, the last meeting of the term is today, and I have to wake up early for a defense (at nine - oi vey). I'll be back.
[0 Comments]
