An Algorithmic and Social Introduction to Computer Science (CSC-105 2000S)


Class 34: Game Trees

Back to Introduction to Artificial Intelligence. On to Expert Systems.

Held Tuesday, April 4, 2000

Overview

Today we delve into some simple ``intelligent'' programs; interacting with Eliza and discussing how many game-playing programs work.

Question 34 for discussion today: 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?

Question 35 for discussion on Wednesday: Model some set of relationships (preferably something other than family trees) with the predicate calculus.

Notes

Contents

Summary


A Computer Psychologist

These notes are adapted from notes from Henry Walker.

Game Trees

Predicate Calculus


History

Saturday, 22 January 2000

Tuesday, 4 April 2000

Back to Introduction to Artificial Intelligence. On to Expert Systems.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS105/2000S/Outlines/outline.34.html

Source text last modified Wed Apr 5 09:47:29 2000.

This page generated on Wed Apr 5 09:49:32 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu