[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Alpha-Beta Search Revisited

  • Conference paper
  • First Online:
Intelligent Data Engineering and Automated Learning — IDEAL 2002 (IDEAL 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2412))

  • 1757 Accesses

Abstract

An algorithm, Aspiration Scout/MTD(f), is derived from an analysis of alpha-beta (α-β) tree search. When compared to its predecessors, it results in an average 10.1% reduction in search effort with a best case of 17.4%. 1 The search space is usually referred to as a tree, however in games such as chess and draughts it is actually a directed acyclic graph (DAG). Programs search a dynamically unfolding DAG.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Eppstein, D.: Strategy and Board Game Programming Lecture Notes, 1997 http://www.ics.uci/~eppstein/180a/s97.html.

  2. Plaat, A., et al: Exploiting Graph Properties of Game Trees, AAAI, 1996.

    Google Scholar 

  3. Schaeffer, J.: The History Heuristic and Alpha-Beta Enhancements in Practice, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 11, 1989.

    Google Scholar 

  4. Schaeffer, J., Plaat, A.: New Advances in Alpha-Beta Searching, Proceedings of the 24th ACM Computer Science Conference, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computation, UMIST, Manchester, UK

    Paul Parkins & John A. Keane

Authors
  1. Paul Parkins
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John A. Keane
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Electronics, UMIST, Manchester, M60 1QD, UK

    Hujun Yin , Nigel Allinson  & Richard Freeman ,  & 

  2. Department of Computation, UMIST, Manchester, M60 1QD, UK

    John Keane

  3. Department of Biomolecular Science, UMIST, Manchester, M60 1QD, UK

    Simon Hubbard

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parkins, P., Keane, J.A. (2002). Alpha-Beta Search Revisited. In: Yin, H., Allinson, N., Freeman, R., Keane, J., Hubbard, S. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2002. IDEAL 2002. Lecture Notes in Computer Science, vol 2412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45675-9_88

Download citation

  • DOI: https://doi.org/10.1007/3-540-45675-9_88

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44025-3

  • Online ISBN: 978-3-540-45675-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation