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

Parallel randomized best-first minimax search.

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

DOI10.1016/S0004-3702(02)00195-9zbMath1052.68023OpenAlexW2025239527MaRDI QIDQ1605282

Sivan Toledo, Yaron Shoham

Publication date: 15 July 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00195-9


zbMATH Keywords

Heuristic searchOthelloAlpha-BetaChessBest-firstJamboree searchTwo-player games


Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)



Uses Software

  • MPI


Cites Work

  • An analysis of alpha-beta pruning
  • Best-first minimax search
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Parallel randomized best-first minimax search.

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