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
Parents
25
1–5 of 25
47
2
h-index
1
h-index
Rutgers, The State University of New Jersey, United States
1 publications · 71 citations
1
h-index
1
h-index
1
h-index
1–5 of 47
31
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
2 publications
24 citations
University College London
London, United Kingdom
1 h-index
1 publications
24 citations

University of North Carolina at Charlotte
Charlotte, United States
1 h-index
1 publications
22 citations
Ben-Gurion University of the Negev
Beersheba, Israel
1 h-index
2 publications
22 citations
National University of Singapore
Singapore, Singapore
1 h-index
4 publications
48 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
2 publications
178 citations

Stellenbosch University
Stellenbosch, South Africa
1 h-index
1 publications
11 citations
Siemens (Austria)
Vienna, Austria
1 h-index
1 publications
36 citations
1–8 of 31
2 publications · 33 citations
2
h-index
2 publications · 131 citations
2
h-index
1 publications · 10 citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5