Computers, Chess, and Cognition presents an excellent up-to-date description of
developments in computer chess, a rapidly advancing area in artificial intelligence research …

Search procedures, such as alpha-beta and SSS∗, are used to solve minimax game trees.
With a notable exception of B∗, most of these procedures assume the static model, ie, the …

Six pruning strategies are empirically compared on uniform and nonuniform game trees
under four schemes of assigning static values to leaf nodes. The performance of these …

The objective of conduct the current research is to understand the deep relationship
between gaming along with how artificial intelligence (AI) is being incorporated into these …

This study introduces a blazingly fast, no‐loss expert system for tic‐tac‐toe using decision
trees called T3DT, which tries to emulate human gameplay as closely as possible. It does …

Die Zielsetzung der Artificial Intelligence (AI) ist es, Maschinen, zu erzeugen, die"
intelligentes" Verhalten zeigen. Dabei spielt in vielerlei Hinsicht das Problemlösen eine …

This paper surveys theoretical results about minimax game trees and the algorithms used to
explore them. The notion of game tree is formally introduced and its relation with game …

This article lists all theoretical and practical papers, theses and reports known to the author
on the subject of studying minimax trees and analyzing sequential and parallel minimax tree …

Computers, Chess, and Cognition presents an excellent up-to-date description of
developments in computer chess, a rapidly advancing area in artificial intelligence research …