Observations
Feb. 15th, 2003 08:02 pm![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
tarigwaemirAd Mundo Exteriore,
I began my partially completed math homework at 10:00 AM. Guess when I finished? 7:00 PM, with one hour breaks for lunch and watching a new KTV drama. Either I'm slow, or the homework was dreadfully long.
Writing entirely in plain text is an...interesting...experience. I'm not entirely used to it.
Finally, I'll be able to update the Society web site from this computer (the iBook). I feel very much relieved.
My Metropolis skin needs a playlist, minibrowser and AVS. Otherwise, it is complete. So why don't I hurry up and get it off my mind? It is a mystery.
I have two more Hikaru no Go manga! Volume 5, courtesy of Lyd-chan, and volume 16, courtesy of my last $5. I wanted volume 17, but it wasn't at Asahiya.
I've been having bad dreams about blood and murder. Why this is the case is beyond me. Actually, the dream made quite a good story—I was curious to find out what would happen next when I woke up—but it was somewhat disturbing.
Had this interesting conversation with a...hm...friend? I don't know, should I call him a friend? I mean, I only started having conversations with him about something other than Science Club and Math Team this year. Well, in any case, the conversation subject was: If you had an infinitely powerful computer (i.e. no limit on its computing ability), would it be possible to calculate all the possible chess games and create a program that told you the best move for each of your turns so that you would always win? Since there is no limit on the computing ability, we had to discuss the extent of determinism present in a chess game. It didn't help that neither of us played chess particularly well. Also, does it make a difference if you're always playing first or second? For example, is it possible to create such a program for the second player, but not the first? I said it was impossible because there was always more than one ideal strategy, but he said that you could at least reject the ridiculous moves for each stage of the game and that the number of ideal strategies decreases as you progress in the game. So, does anyone who knows chess have any convincing arguments for either side? A somewhat pleasant break after all the "Frodo! Frodo!" so-called conversations I've been having with some delinquents who won't even show up to the Science Club...(just kidding, Lyd-chan).
Also, er, that AP French presentation is coming up. I repeat my bribe: an LJ icon for anyone who suggests arguments concerning Internet fanfiction and copyright law. Preferably in French. If you don't know the French word, just use the English one, and I'll look it up myself. Help?
...Tari
I began my partially completed math homework at 10:00 AM. Guess when I finished? 7:00 PM, with one hour breaks for lunch and watching a new KTV drama. Either I'm slow, or the homework was dreadfully long.
Writing entirely in plain text is an...interesting...experience. I'm not entirely used to it.
Finally, I'll be able to update the Society web site from this computer (the iBook). I feel very much relieved.
My Metropolis skin needs a playlist, minibrowser and AVS. Otherwise, it is complete. So why don't I hurry up and get it off my mind? It is a mystery.
I have two more Hikaru no Go manga! Volume 5, courtesy of Lyd-chan, and volume 16, courtesy of my last $5. I wanted volume 17, but it wasn't at Asahiya.
I've been having bad dreams about blood and murder. Why this is the case is beyond me. Actually, the dream made quite a good story—I was curious to find out what would happen next when I woke up—but it was somewhat disturbing.
Had this interesting conversation with a...hm...friend? I don't know, should I call him a friend? I mean, I only started having conversations with him about something other than Science Club and Math Team this year. Well, in any case, the conversation subject was: If you had an infinitely powerful computer (i.e. no limit on its computing ability), would it be possible to calculate all the possible chess games and create a program that told you the best move for each of your turns so that you would always win? Since there is no limit on the computing ability, we had to discuss the extent of determinism present in a chess game. It didn't help that neither of us played chess particularly well. Also, does it make a difference if you're always playing first or second? For example, is it possible to create such a program for the second player, but not the first? I said it was impossible because there was always more than one ideal strategy, but he said that you could at least reject the ridiculous moves for each stage of the game and that the number of ideal strategies decreases as you progress in the game. So, does anyone who knows chess have any convincing arguments for either side? A somewhat pleasant break after all the "Frodo! Frodo!" so-called conversations I've been having with some delinquents who won't even show up to the Science Club...(just kidding, Lyd-chan).
Also, er, that AP French presentation is coming up. I repeat my bribe: an LJ icon for anyone who suggests arguments concerning Internet fanfiction and copyright law. Preferably in French. If you don't know the French word, just use the English one, and I'll look it up myself. Help?
...Tari
