Article View: csd.grad
Article #3560CMSC 858, Computers and Games
From: Clyde P. Kruskal
Date: Tue, 24 Aug 1999 00:00
Date: Tue, 24 Aug 1999 00:00
18 lines
1306 bytes
1306 bytes
Traditional Game theory deals with games that people don't actually play. This is a scandal! By contrast WE will study a type of game theory that applies to games people really DO play such as Chess, Bridge, Go, Backgammon, and others. In studying these games we will learn some traditional game theory, some combinatorial game theory, and some complexity of games. We will also look at how computers play games Some games are EASY for a computer (just ask Kasporov). Some games are HARD for a computer (e.g., Go). What is the difference? We will pick up the mathematics needed as we go along. PREREQUISITE: CMSC 451 or a course in algorithms. Elementary knowledge of probability and combinatorics.
Technical Details
Message-ID:
<199908242004.QAA08658@galahad.cs.umd.edu>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailShow Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 10f4d5,82da56deb4414430,start X-Google-Attributes: gid10f4d5,public From: kruskal@cs.umd.edu (Clyde P. Kruskal) Subject: CMSC 858, Computers and Games Date: 1999/08/24 Message-ID: <199908242004.QAA08658@galahad.cs.umd.edu> X-Deja-AN: 516719583 X-Trace: cronkite.cs.umd.edu 935525081 7121 128.8.128.180 (24 Aug 1999 20:04:41 GMT) Organization: U of Maryland, Dept. of Computer Science, College Park, MD 20742 NNTP-Posting-Date: 24 Aug 1999 20:04:41 GMT Newsgroups: csd.grad X-Complaints-To: abuse@cs.umd.edu