Map<PlayerType, int> scores = {};

  final Map<PlayerType, int> minScoreByPlayer = {};
  final Map<PlayerType, int> maxScoreByPlayer = {};

  double ucb1(PlayerType player, int maxScore, double priorScore) {

  double ucb1(PlayerType player, double priorScore) {

      return 0.0;

      return priorScore;

    double normalizedScore = (maxScoreByPlayer[player] ?? 0) / maxScore;
    var ucb = (normalizedScore +
            (winsByPlayer[player] ?? 0 + (draws * 0.5)) / visits) +

    var ucb = ((winsByPlayer[player] ?? 0 + (draws * 0)) / visits) +

    var maxScore = 1;
    var minScore = 0;
    sortedChildren.forEach((child) {
      maxScore = max(maxScore, child.value.maxScoreByPlayer[player] ?? 0);
      minScore = min(minScore, child.value.minScoreByPlayer[player] ?? 0);
    });

      if (_moveProbabilitiesFromNN.isNotEmpty &&
          (aVisits == 0 || bVisits == 0)) {
        return (_moveProbabilitiesFromNN[b.key]!)
            .compareTo(_moveProbabilitiesFromNN[a.key]!);
      }

      double bScore = b.value
          .ucb1(player, maxScore, _moveProbabilitiesFromNN[b.key] ?? 1.0);
      double aScore = a.value
          .ucb1(player, maxScore, _moveProbabilitiesFromNN[a.key] ?? 1.0);

      double bScore =
          b.value.ucb1(player, _moveProbabilitiesFromNN[b.key] ?? 1.0);
      double aScore =
          a.value.ucb1(player, _moveProbabilitiesFromNN[a.key] ?? 1.0);

        gameState!.scores.forEach((player, score) {
          currentNode!.maxScoreByPlayer.update(
              player, (value) => score > value ? score : value,
              ifAbsent: () => score);
          currentNode.minScoreByPlayer.update(
              player, (value) => score < value ? score : value,
              ifAbsent: () => score);
        });