Enumerating Backgammon Positions: The Perfect Hash |
Previous | 2 of 5 | Next |
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
|
This page
All
Subset |
Object Description
| Rating | |
| Title | Interface Journal vol 16, no 1, Spring 1997 |
| Creator | Harvey Mudd College |
| Contributors | Benjamin, Arthur; Ross, Andrew; Hartzog, Anna; Brown, Abigail; Bradley, Dan; Sondhi, Radhika |
| Subject |
Mathematics Dynamic programming Probabilities Backgammon Hashing (Computer science) Theater – History Mathematics – Study and teaching Physics Quantum computers Factorization (Mathematics) |
| Description |
Table of Contents : "Enumerating Backgammon Positions: The Perfect Hash" by Arthur Benjamin, Andrew Ross "The Development of European Drama" by Anna Hartzog "Calculus Reform and Reform Philosophy in High School Mathematics" by Abigail Brown "Quantum Computation" by Dan Bradley, Radhika Sondhi |
| Publisher | Harvey Mudd College |
| Date | 1997 |
| Language | eng |
| Source | Original publication: Interface Journal - An Interdisciplinary Journal of Undergraduate Research at Harvey Mudd College; vol 16, no 1, Spring 1997 |
| Collection | Interface Journal Archive http://ccdl.libraries.claremont.edu/col/ija |
| Relation - Is Format Of | http://www.math.hmc.edu/interface/ |
| Rights | Interface: An interdisciplinary journal of student research at Harvey Mudd College has non-exclusive publication rights to the articles contained in each issue. Permission is granted to quote from the journal with the customary acknowledgment of the source. Copyright for each article is retained by the author. Republication in any form requires permission from the author of the article. |
| Type | Text |
| Format | application/pdf |
| Object File Name | ija00022 |
Description
| Title | Enumerating Backgammon Positions: The Perfect Hash |
| Creator |
Benjamin, Arthur Ross, Andrew |
| Subject |
Mathematics Dynamic programming Probabilities Backgammon Hashing (Computer science) |
| Description | Abstract: Like many games, people place money wagers on backgammon games. These wagers can change during the game. In order to make intelligent bets, one needs to know the chances of winning at any point in the game. We were working on this for positions near the end of the game when we needed to explicitly label each of the positions so the computer could refer to them. The labeling developed here uses the least possible amount of computer memory, is reasonably fast, and works well with a technique known as dynamic programming. |
| Publisher | Harvey Mudd College |
| Date | 1997 |
| Language | eng |
| Source | Original publication: Interface Journal - An Interdisciplinary Journal of Undergraduate Research at Harvey Mudd College; vol 16, no 1, Spring 1997 |
| Collection | Interface Journal Archive http://ccdl.libraries.claremont.edu/col/ija |
| Relation - Is Format Of | http://www.math.hmc.edu/interface/ |
| Rights | Interface: An interdisciplinary journal of student research at Harvey Mudd College has non-exclusive publication rights to the articles contained in each issue. Permission is granted to quote from the journal with the customary acknowledgment of the source. Copyright for each article is retained by the author. Republication in any form requires permission from the author of the article. |
| Type | Text |
| Format | application/pdf |
| Object File Name | ija00022_0002 |
Tags
Add tags for Enumerating Backgammon Positions: The Perfect Hash
Comments
Post a Comment for Enumerating Backgammon Positions: The Perfect Hash
