Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3992828
Jump to:navigation, search

zbMath0668.68113MaRDI QIDQ3992828

Andrew J. Palay

Publication date: 17 September 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

search algorithmschess programs\(B^*\)-algorithmalpha-beta algorithmdecision- algorithmsdelphic value


Mathematics Subject Classification ID

Searching and sorting (68P10) Management decision making, including multiple objectives (90B50) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory for games (91A35)


Related Items (9)

Game tree searching by min/max approximation ⋮ Proof-Number Search and Its Variants ⋮ A Bayesian approach to relevance in game playing ⋮ About the Completeness of Depth-First Proof-Number Search ⋮ The effect of mobility on minimaxing of game trees with random leaf values ⋮ Improving heuristic mini-max search by supervised learning ⋮ Using Chunking to solve chess pawn endgames ⋮ A solution to the GHI problem for best-first search ⋮ Parallel randomized best-first minimax search.




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3992828&oldid=13487831"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:08.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki