Thomas Dybdahl Ahle <lobais at gmail.com> writes: > Do you have any ideas how I can sort these moves the fastest? One idea: if you're using alpha-beta pruning, maybe you can use something like heapq instead of sorting, since a lot of the time you only have to look at the first few moves (ordered best-first).