Diffstat (limited to 'noncore/games/wordgame/wordgame.cpp') (more/less context) (show whitespace changes)
-rw-r--r-- | noncore/games/wordgame/wordgame.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/noncore/games/wordgame/wordgame.cpp b/noncore/games/wordgame/wordgame.cpp index a80bd35..47d6725 100644 --- a/noncore/games/wordgame/wordgame.cpp +++ b/noncore/games/wordgame/wordgame.cpp | |||
@@ -666,25 +666,25 @@ void ComputerPlayer::findBest(QPoint at, const QPoint& d, const QDawg::Node* nod | |||
666 | } | 666 | } |
667 | findBest(at, d, node->next(), used, nletter, tiles, n, blankvalues, blused); | 667 | findBest(at, d, node->next(), used, nletter, tiles, n, blankvalues, blused); |
668 | } | 668 | } |
669 | 669 | ||
670 | void ComputerPlayer::noteChoice(const Tile** tiles, int n, const QPoint& d, const Tile* blankvalues, int blused) | 670 | void ComputerPlayer::noteChoice(const Tile** tiles, int n, const QPoint& d, const Tile* blankvalues, int blused) |
671 | { | 671 | { |
672 | int s = board->score(current, tiles, n, blankvalues, d, TRUE, 0); | 672 | int s = board->score(current, tiles, n, blankvalues, d, TRUE, 0); |
673 | /* | 673 | /* |
674 | if (s>0 || current==QPoint(5,1)){ | 674 | if (s>0 || current==QPoint(5,1)){ |
675 | QString st; | 675 | QString st; |
676 | for ( int i=0; i<n; i++ ) | 676 | for ( int i=0; i<n; i++ ) |
677 | st += tiles[i]->text(); | 677 | st += tiles[i]->text(); |
678 | qDebug("%d,%d: %s (%d) for %d",current.x(),current.y(),st.latin1(),n,s); | 678 | odebug << "" << current.x() << "," << current.y() << ": " << st.latin1() << " (" << n << ") for " << s << "" << oendl; |
679 | } | 679 | } |
680 | */ | 680 | */ |
681 | if ( s > best_score ) { | 681 | if ( s > best_score ) { |
682 | int i; | 682 | int i; |
683 | for ( i=0; i<n; i++ ) | 683 | for ( i=0; i<n; i++ ) |
684 | best[i] = tiles[i]; | 684 | best[i] = tiles[i]; |
685 | for ( i=0; i<blused; i++ ) | 685 | for ( i=0; i<blused; i++ ) |
686 | best_blankvalues[i] = blankvalues[i]; | 686 | best_blankvalues[i] = blankvalues[i]; |
687 | best_n = n; | 687 | best_n = n; |
688 | best_blused = blused; | 688 | best_blused = blused; |
689 | best_score = s; | 689 | best_score = s; |
690 | best_dir = d; | 690 | best_dir = d; |