BUG: There are only 4095 items in the buffer that is zero'd out using 4096.

FIX: Fix the number used in memset.

1 files changed, 1 insertions, 1 deletions

diff --git a/noncore/games/wordgame/wordgame.cpp b/noncore/games/wordgame/wordgame.cpp
index 52e2be2..8cf92ef 100644
--- a/noncore/games/wordgame/wordgame.cpp
+++ b/noncore/games/wordgame/wordgame.cpp
@@ -527,129 +527,129 @@ void WordGame::passTurn()
 bool WordGame::refillRack(int i)
 {
     Rack* r = rack(i);
     while ( !bag->isEmpty() && !r->isFull() ) {
         r->addTile(bag->takeRandom());
     }
     return r->count() != 0;
 }
 
 void WordGame::readyRack(int i)
 {
     Rack* r = rack(i);
     racks->raiseWidget(i);
     board->setCurrentRack(r);
 
     done->setEnabled( !r->computerized() );
     reset->setEnabled( !r->computerized() );
 
     if ( r->computerized() ) {
         cpu = new ComputerPlayer(board, r);
         aiheart->start(0);
     }
 }
 
 Rack* WordGame::rack(int i) const
 {
     return (Rack*)racks->widget(i);
 }
 
 void WordGame::think()
 {
     if ( !cpu->step() ) {
         delete cpu;
         cpu = 0;
         aiheart->stop();
         if ( board->turnScore() < 0 )
             passTurn();
         else
             endTurn();
     }
 }
 
 ComputerPlayer::ComputerPlayer(Board* b, Rack* r) :
     board(b), rack(r), best(new const Tile*[rack_tiles]),
         best_blankvalues(new Tile[rack_tiles])
 {
     best_score = -1;
     across=FALSE;
     dict=0;
 }
 
 ComputerPlayer::~ComputerPlayer()
 {
     delete [] best;
     delete [] best_blankvalues;
 }
 
 bool ComputerPlayer::step()
 {
     const QDawg::Node* root = dict ? Global::dawg("WordGame").root()
                                 : Global::fixedDawg().root();
     QPoint d = across ? QPoint(1,0) : QPoint(0,1);
     const Tile* tiles[99]; // ### max board size
     uchar nletter[4095]; // QDawg only handles 0..4095
-    memset(nletter,0,4096);
+    memset(nletter,0,4095);
     for (int i=0; i<rack->count(); i++) {
         const Tile* r = rack->tileRef(i);
         if ( r->isBlank() )
             nletter[0]++;
         else
             nletter[r->text()[0].unicode()]++;
     }
     Tile blankvalues[99]; // ### max blanks
     findBest(current, d, root, 0, nletter, tiles, 0, blankvalues, 0);
     if ( ++current.rx() == board->xTiles() ) {
         current.rx() = 0;
         if ( ++current.ry() == board->yTiles() ) {
             if ( across ) {
                 if ( dict == 1 ) {
                     if ( best_score >= 0 ) {
                         rack->arrangeTiles(best,best_n);
                         rack->setBlanks(best_blankvalues);
                         board->scoreTurn(best_start, best_n, best_dir);
                         board->showTurn();
                     }
                     return FALSE;
                 }
                 dict++;
                 across = FALSE;
                 current = QPoint(0,0);
             } else {
                 across = TRUE;
                 current = QPoint(0,0);
             }
         }
     }
     return TRUE;
 }
 
 void ComputerPlayer::findBest(QPoint at, const QPoint& d, const QDawg::Node* node, ulong used, uchar* nletter, const Tile** tiles, int n, Tile* blankvalues, int blused)
 {
     if ( !node )
         return;
     QChar l = node->letter();
     const Tile* cur = board->tile(at);
     if ( cur ) {
         if ( cur->text()[0] == l ) {
             bool nextok =  board->contains(at+d);
             if ( node->isWord() && n && (!nextok || !board->tile(at+d)) )
                 noteChoice(tiles,n,d,blankvalues,blused);
             if ( nextok )
                 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