{"version":"1.0","type":"link","title":"Move ordering - Newikis","description":"Move ordering refers to the practice of selecting the most promising moves first during game-tree search (especially in computer chess). In minimax searches with alpha–beta pruning, good move ordering is important, examining stronger moves early causes cutoffs that eliminate subtrees, vastly…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}