Computer Games I - Classic Papers on Computer Strategy Games

In this review of Computer Games I the reviewer finds a focused, historical compendium best suited to readers who want to understand foundational ideas behind computer strategy games. The single biggest reason to buy is the collection of seminal papers by pioneers such as Claude Shannon, Edward O. Thorpe and Hans Berliner, which together provide both the mathematical underpinnings and practical programming insights that influenced early game AI. This volume reads like a snapshot of the ideas that shaped contemporary approaches to chess, card play and strategy programming.

Key Features

• Foundational papers: Collects influential essays that form the basis of many modern computer chess and strategy programs, giving historical context and technical depth.
• Range of perspectives: Includes both mathematical analyses and qualitative discussion, useful for readers interested in theory and design choices.
• Programming relevance: Features work aimed at practitioners, with material that can inform the development of game-playing software and heuristics.
• Contributors from the field: Presents selections from major developers whose ideas directly shaped computer game strategy, providing original source material.
• Two-volume compendium: As the first volume, it offers a concentrated selection of key papers and sets up the broader treatment found across both volumes.

Who It's For

Computer Games I is best for students of computer science, hobbyist programmers, and historians of AI who want direct access to original work that influenced early game-playing programs. Researchers seeking historical sources or engineers looking for classical methods will find useful material on analysis, decision approaches and design trade-offs.

Those seeking a modern textbook, step-by-step tutorials in current frameworks, or up-to-date empirical results may prefer more recent resources; this volume is archival and focused on primary papers rather than contemporary pedagogy.

Pros & Cons

Pros

• Primary-source content from leading figures gives authentic historical and technical insight.
• Balanced selection spans mathematical analysis and practical programming concerns.
• Useful reference material for developers who want to ground modern approaches in classical work.

Cons

• Material is archival and can feel dated for readers expecting current implementations or modern algorithmic updates.

Specifications

Our Verdict

Computer Games I is a valuable archival collection for anyone wanting to study the roots of computer strategy and game-playing AI. It delivers primary-source perspectives and technical discussion that remain informative for historical study and for programmers interested in classical approaches, offering good value as a specialist reference rather than a modern textbook.

Frequently Asked Questions

Does this volume include original papers by major researchers?
Yes, it contains selections from key figures such as Claude Shannon, Edward O. Thorpe and Hans Berliner.

Is this book suitable for modern game programming instruction?
It is more historical and theoretical than a current programming manual; useful for conceptual grounding but not as a step-by-step modern tutorial.

Is this the complete treatment of the topic?
It is the first volume in a two-part compendium, offering a concentrated set of foundational papers rather than exhaustive coverage.