Class 33: Introduction to Artificial Intelligence

Held Monday, April 3, 2000

Overview

Today we begin to consider issues of artificial intelligence. Today's outline does not yet have an overview. Please let me know if you think it should have one.

Question 33 for today's class: What, in your own words, would be sufficient criteria to judge a program as "intelligent"?

Question 34 for Tuesday's class: The algorithms Dewdney describes assume that both players make the best possible move. How would the min-max and alpha-beta pruning algorithms change if one player selected a move randomly?

Notes

• Notes on the Risks I sent you over break are due on Friday.
• Among the many things that I planned to do over break and lacked the time to do: write sample stories. Hence, you are no longer required to write those stories. You may do so for some extra credit, though.
  • I also didn't have time to do more grading of your work to date.
  • Expect an interesting assignment having to do with these various issues.
• Read Dewdney, chapter 6 (game trees) for tomrorow.
• Sarah will look for a copy of Eliza for tomorrow.

Contents

• A Note on SlashDot from Cathy's Friend
• Discussion

Summary

A Note on SlashDot from Cathy's Friend

I know you really love it when I give you links like this, but I really am worked up about all the copyright issues that have cropped up recently.

Find attached a slashdot debate on the DMCA. It's too late to really submit a comment to the Copyright office about it, but it doesn't hurt to be aware.

Pay particular attention to this thread:

It is very educational and features a few posts from YT.

I encourage you to hand out fliers explaining the DMCA and maybe what the MPAA has done to me:

Discussion

• It is now your goal to raise interesting points (and followup discussion) based on the readings and questions.
• We'll use the old standby of assigning roles.
  • Discussion leader: Kevin
  • Fact-checker: Jeana
  • Devil's advocate: Cathy
  • Recorder: Jeff