Revert "search: sort moves by score in root of search"

This reverts commit b889c41.
e0ff · Nov 25, 2023 · 36cc95d · 36cc95d
1 parent 661d92c
commit 36cc95d
Showing 1 changed file with 1 addition and 5 deletions.
diff --git a/internal/search/negamax.go b/internal/search/negamax.go
@@ -33,14 +33,10 @@ 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)