MARLA : a chess playing program

Graduate Thesis Or Dissertation

Público Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/d791sk84g

Descriptions

Attribute Name	Values
Creator	Rood, Andrew Lloyd
Abstract	MARLA is a collection of FORTRAN routines which implements the Shannon-type-chess program with alphabeta cutoffs occurring dynamically. Board positions are updated incrementally. Also involved in position analysis is a production system which models the human chess player's advice-taking, theme, and chess learning in a general sense. Interfacing these two sections, one algorithmic and one semantic, are two attributed translation grammars. Both use a terminal saturation technique to achieve top-down LL(1) parsing. One grammar translates feature descriptions into feature recognisers, the other recognizes and decodes strategies. The program also exhibits some natural language understanding.
Resource Type	Masters Thesis
Fecha Disponible	2013-10-08T20:23:08+00:00
Fecha de Emisión	1977-05-06
Degree Level	Master's
Degree Name	Master of Science (M.S.)
Degree Field	Computer Science
Degree Grantor	Oregon State University
Commencement Year	1978
Advisor	Bregar, William
Academic Affiliation	Computer Science
Non-Academic Affiliation	Oregon State University. Graduate School
Subject	Chess -- Computer programs
Declaración de derechos	Copyright Not Evaluated
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]
Digitization Specifications	File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0 on a Canon DR-9050C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces	http://hdl.handle.net/1957/43165

Parents:

This work has no parents.

En Collection:

Miniatura	Título	Fecha de subida	Visibilidad	Acciones
	RoodAndrewLloyd1978.pdf	2017-08-23	Público	Descargar