Laramée, François Dominic (2001) Design and implementation of a chess-playing program in the Java programming language. [Graduate Projects (Non-thesis)] (Unpublished)
Preview |
Text (application/pdf)
4MBMQ68470.pdf |
Abstract
This project describes the design and implementation of an object-oriented chess-playing program, based on current software engineering practice, recent advances, including the MTD(f) search algorithm, and time-honored techniques perfected by artificial intelligence pioneers since the late 1960's, like the transposition table, the history heuristic and an evaluation function slanted towards material advantage. Where appropriate, a comparative survey of alternative algorithms not implemented in this project is also included.
| Divisions: | Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering |
|---|---|
| Item Type: | Graduate Projects (Non-thesis) |
| Authors: | Laramée, François Dominic |
| Pagination: | iii, 138 leaves : ill. ; 29 cm. |
| Institution: | Concordia University |
| Degree Name: | M. Comp. Sc. |
| Program: | Computer Science |
| Department (as was): | Department of Computer Science |
| Date: | 2001 |
| Thesis Supervisor(s): | Lam, Clement |
| Identification Number: | QA 76 M26+ 2001 no.31 |
| ID Code: | 1703 |
| Deposited By: | lib-batchimporter |
| Deposited On: | 27 Aug 2009 17:21 |
| Last Modified: | 20 Oct 2022 20:44 |
| Related URLs: |
Repository Staff Only: item control page
Download Statistics
Download Statistics