search: sort moves by score in root of search

e0ff · Nov 25, 2023 · b889c41 · b889c41
1 parent 1381d00
commit b889c41
Showing 1 changed file with 5 additions and 1 deletion.
diff --git a/internal/search/negamax.go b/internal/search/negamax.go
@@ -33,10 +33,14 @@ func NewNegamaxSearcher(evaluator evaluation.Evaluator) NegamaxSearcher {
 }
 
 func (s NegamaxSearcher) Search(position chess.Position, depth int) ScoredMove {
-	moves := position.GenerateMoves(chess.LegalMoveGeneration)
 	bestMove := ScoredMove{}
 	bestScore := math.MinInt + 1
 
+	moves := position.GenerateMoves(chess.LegalMoveGeneration)
+	slices.SortFunc(moves, func(m1, m2 chess.Move) int {
+		return cmp.Compare(s.scoreMove(position, m1), s.scoreMove(position, m2))
+	})
+
 	for _, move := range moves {
 		position.MakeMove(move)