✦ LIBER ✦

An incremental negamax algorithm

✍ Scribed by Ingo Althöfer

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 343 KB
Volume: 43
Category: Article
ISSN: 0004-3702
DOI: 10.1016/0004-3702(90)90070-g

No coin nor oath required. For personal study only.

✦ Synopsis

In certain models of game trees with erroneous evaluation functions the minimax algorithm does not reduce errors, even under favourable assumptions about the size of the errors and the frequency of their occurrence. We present an incremental negamax algorithm, which uses estimates of all nodes in the tree (rather than only those of the leaves) to determine the root value. Under the assumption of independently occurring and sufficiently small errors, the algorithm is shown to have exponentially reduced error probabilities with respect to the height of the tree.

📜 SIMILAR VOLUMES

An advanced dual incremental network alg

An advanced dual incremental network algorithm

✍ Stephen R. Schmidt; Paul A. Jensen; J. Wesley Barnes 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 782 KB

An incremental algorithm for identificat

An incremental algorithm for identification of longest (shortest) paths

✍ Sandip Kundu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Incremental learning of collaborative cl

Incremental learning of collaborative classifier agents with new class acquisition: An incremental genetic algorithm approach

✍ Sheng-Uei Guan; Fangming Zhu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

A number of soft computing approaches such as neural networks, evolutionary algorithms, and fuzzy logic have been widely used for classifier agents to adaptively evolve solutions on classification problems. However, most work in the literature focuses on the learning ability of the individual classi

An incremental algorithm to construct a

An incremental algorithm to construct a lattice of set intersections

✍ Derrick G. Kourie; Sergei Obiedkov; Bruce W. Watson; Dean van der Merwe 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 864 KB

a b s t r a c t An incremental algorithm to construct a lattice from a collection of sets is derived, refined, analyzed, and related to a similar previously published algorithm for constructing concept lattices. The lattice constructed by the algorithm is the one obtained by closing the collection o

An incremental data mining algorithm for

An incremental data mining algorithm for compact realization of prototypes

✍ V.S. Ananthanarayana; M.N. Murty; D.K. Subramanian 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 102 KB

An Incremental Algorithm for a Generaliz

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

✍ G. Ramalingam; Thomas Reps 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv