Best-first minimax search (Q2171269)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Best-first minimax search	scientific article

Statements

scholarly article

0 references

Best-first minimax search (English)

0 references

Richard E. Korf

0 references

David Maxwell Chickering

0 references

Artificial Intelligence

0 references

publication date

23 September 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0004-3702(95)00096-8

0 references

Heuristic search in restricted memory

0 references

The heuristic search under conditions of error

0 references

Searching for an optimal path in a tree with random costs

0 references

0 references

An analysis of alpha-beta pruning

0 references

Linear-space best-first search

0 references

0 references

Conspiracy numbers for min-max search

0 references

0 references

The last player theorem

0 references

An investigation of the causes of pathology in games

0 references

The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores

0 references

0 references

Game tree searching by min/max approximation

0 references

A world-championship-level Othello program

0 references

0 references

0 references

Experiments With Some Programs That Search Game Trees

0 references

A minimax algorithm better than alpha-beta?

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0004-3702(95)00096-8

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2171269

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2171269&oldid=36855470"