Move Ordering

Move Ordering is a search optimization technique in game-playing algorithms that ranks possible moves at a given position to prioritize the exploration of more promising branches first, thereby improving the efficiency of minimax-based search through earlier pruning in alpha-beta pruning.

25

Publications

809

Citations

47

Authors

31

Institutions

Publications per year

2017–2026

2

Authors

47

  1. AS
    Aviezri S. Fraenkel

    Weizmann Institute of Science, Israel

    2 publications · 131 citations

    2

    h-index

  2. WP
    Wim Pijls

    Erasmus University Rotterdam, Netherlands

    1 publications · 23 citations

    1

    h-index

  3. AK
    Athanasios Krontiris

    Rutgers, The State University of New Jersey, United States

    1 publications · 71 citations

    1

    h-index

  4. HY
    H. Y. Quek

    National University of Singapore, Singapore

    1 publications · 12 citations

    1

    h-index

  5. JH
    Jonathan Hamilton

    University of Florida, United States

    1 publications · 25 citations

    1

    h-index

1–5 of 47

Venues

  1. ICGA Journal

    2 publications · 33 citations

    2

    h-index

  2. American Mathematical Monthly

    2 publications · 131 citations

    2

    h-index

  3. International Journal of Man-Machine Studies

    1 publications · 10 citations

    1

    h-index

  4. Artificial Intelligence

    1 publications · 14 citations

    1

    h-index

  5. Theoretical Computer Science

    1 publications · 11 citations

    1

    h-index

1–5