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

An analysis of the conspiracy numbers algorithm

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

DOI10.1016/0898-1221(94)90005-1zbMath0805.68109OpenAlexW2089263616MaRDI QIDQ1324392

V. Pereyra

Publication date: 26 January 1995

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(94)90005-1


zbMATH Keywords

heuristic searchminimax searchalpha-beta searchstate space searchconspiracy numbers


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)


Related Items (1)

An analysis of the conspiracy numbers algorithm




Cites Work

  • Unnamed Item
  • Game tree searching by min/max approximation
  • Conspiracy numbers for min-max search
  • A minimax algorithm better than alpha-beta?
  • An analysis of alpha-beta pruning
  • An analysis of the conspiracy numbers algorithm




This page was built for publication: An analysis of the conspiracy numbers algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1324392&oldid=13452315"
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 12:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki