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
@@ -630,97 +630,97 @@ void ComputerPlayer::findBest(QPoint at, const QPoint& d, const QDawg::Node* nod
 		findBest(at+d, d, node->jump(), used, nletter, tiles, n, blankvalues, blused);
 	    // #### text()[1]...
 	}
     } else {
 	if ( nletter[l.unicode()] || nletter[0] ) {
 	    int rc = rack->count();
 	    ulong msk = 1;
 	    for ( int x=0; x<rc; x++ ) {
 		if ( !(used&msk) ) {
 		    const Tile* t = rack->tileRef(x);
 		    if ( t->isBlank() || t->text() == l ) { // #### multi-char value()s
 			bool nextok =  board->contains(at+d);
 			tiles[n++] = t;
 			if ( t->isBlank() )
 			    blankvalues[blused++] = Tile(l,0);
 			if ( node->isWord() && (!nextok || !board->tile(at+d)) )
 			    noteChoice(tiles,n,d,blankvalues,blused);
 			used |= msk; // mark
 			nletter[t->text()[0].unicode()]--;
 			if ( nextok )
 			    findBest(at+d, d, node->jump(), used, nletter, tiles, n, blankvalues, blused);
 			n--;
 			nletter[t->text()[0].unicode()]++;
 			if ( t->isBlank() ) {
 			    // keep looking
 			    blused--;
 			    used &= ~msk; // unmark
 			} else {
 			    break;
 			}
 		    }
 		}
 		msk <<= 1;
 	    }
 	}
 	// #### text()[1]...
     }
     findBest(at, d, node->next(), used, nletter, tiles, n, blankvalues, blused);
 }
 
 void ComputerPlayer::noteChoice(const Tile** tiles, int n, const QPoint& d, const Tile* blankvalues, int blused)
 {
     int s = board->score(current, tiles, n, blankvalues, d, TRUE, 0);
 /*
 if (s>0 || current==QPoint(5,1)){
 QString st;
 for ( int i=0; i<n; i++ )
     st += tiles[i]->text();
-qDebug("%d,%d: %s (%d) for %d",current.x(),current.y(),st.latin1(),n,s);
+odebug << "" << current.x() << "," << current.y() << ": " << st.latin1() << " (" << n << ") for " << s << "" << oendl; 
 }
 */
     if ( s > best_score ) {
 	int i;
 	for ( i=0; i<n; i++ )
 	    best[i] = tiles[i];
 	for ( i=0; i<blused; i++ )
 	    best_blankvalues[i] = blankvalues[i];
 	best_n = n;
 	best_blused = blused;
 	best_score = s;
 	best_dir = d;
 	best_start = current;
     }
 }
 
 int TileItem::smallWidth()
 {
     return tile_smallw;
 }
 
 int TileItem::smallHeight()
 {
     return tile_smallh;
 }
 
 int TileItem::bigWidth()
 {
     return tile_bigw;
 }
 
 int TileItem::bigHeight()
 {
     return tile_bigh;
 }
 
 void TileItem::setState( State state )
 {
     hide();
     s = state;
     show(); // ### use update() in Qt 3.0
 }
 
 void TileItem::setTile(const Tile& tile)
 {
     hide();
     t = tile;
     show(); // ### use update() in Qt 3.0