There is a computer science topic called decision trees, which are used to map out all possible decisions and their results, and the next possible decisions and results after that, and so on. This is the method Deep Blue used to beat the world chess champion. There are lots of algorithms for minimizing the size of the tree, maximizing the quality
(
Read more... )
Comments 6
(The comment has been removed)
Creepy how much sense this all makes.
Reply
Reply
I like what Nick says about being a main character. And I think an important thing, too, is that none of those main characters become main characters by analyzing decision trees.
I probably don't believe in such a thing as an optimal path.
Reply
Reply
I definately miss the Astronomy at UW, we don't have any classes at all (but we do have a planetarium, go figure.) I took 101, 150, and started going to Thermonuclear Astrophysics before it became clear that a bug in the website allowed me to register for this senior level class.
I did end up registering for the hard CS class. Seems the easier (software based) one is intended for the lesser CS programs, like Computer Information Systems. It will be tough, but I think I'll do ok.
Computer Systems Design: 4 credits, the hardware one.
Computer Networks: 4 credits, AKA Advanced Network Programming.
Disributed Multiprocessor Environments: 4 credits. I actually think this stuff is awesome, and is my only elective this quarter.
College Teaching Internship: 6 credits, even though I only have 2 hours of class this quarter.
Reply
Reply
Leave a comment