TweetFollow Us on Twitter

Oct 01 Challenge

Volume Number: 17 (2001)
Issue Number: 10
Column Tag: Programmer's Challenge

by Bob Boonstra, Westford, MA

Programmer's Assistant

How often has this happened to you? You're working on a piece of code, perhaps even a piece of Challenge code, you add a couple of lines, you compile, and you get some bizarre error. Something nothing near where you were editing. Perhaps an "Illegal function definition ..." in a routine you weren't even working on. And then you realize, eventually if you are slow, or immediately if you are less slow, that you added an "if (condition) {" statement and omitted the closing brace. Or some other simple syntax error.

Well, I happen to think that computers ought to be able to help us with this. My editor ought to do more to help me avoid mistakes. Yes, I know that some editors will balance parentheses for you, assuming you remembered to type the closing paren. But I want more. And this month's Challenge asks you to write such an editor for C/C++.

The first required feature is auto-completion of key words and user-defined names. For example, if I have defined variables "loop_index" and "loop_counter", then, after I type enough characters to uniquely identify a variable name (e.g., "loop_i"), my programmer's assistant should supply the remaining letters "ndex". The automatically supplied characters should be selected so that they are replaced in the event I continue typing. As a highly desirable optional feature, the assistant should offer me an auto-completion key (e.g., the option key, or a menu item with a keyboard equivalent), which, when pressed, offers me a popup menu of possible completions for the word currently being typed, even when the completion is not uniquely identified.

The second required feature is auto-completion of syntactic elements. If I start a conditional by typing "if", my programmer's assistant should, when prompted by an auto-completion key, complete the conditional by inserting parentheses, braces, and an "else" clause, leaving something like this:

if () {
} else {

In this example, the cursor ought to be left between the parentheses, so that I can insert the conditional. You ought to provide some convenient way for me to move the cursor from the conditional (between the parentheses) to the TRUE branch (between the first pair of braces) to the FALSE branch (between the second pair of braces).

You would provide similar auto-completion for while loops, do loops, for loops:

while () {

for ( ; ; ) {

do {
} while ();

Other required auto-completions include case statements, struct declarations, enum declarations, and function declarations. Additional auto-completion features may be incorporated at your option. Other options (e.g., indentation styles) will also earn extra feature points.

A significant amount of extra consideration will be given to any solution that allow support for other languages, through use of a configuration file, provided such a configuration file is provided for C/C++ and at least one other language.

This will be a native PowerPC Challenge, using any of the following environments: CodeWarrior, REALbasic (version 3.2.1 or earlier), MetaCard (version 2.3.2 or earlier), Revolution (version 1.0), or Project Builder. You may use another development environment if I can arrange to obtain a copy - email to check before you use something else. You can develop for Mac OS 9 or Mac OS X. This will be another Challenge based on a subjective evaluation of which entry best satisfies the required features, provides the most attractive set of optional features, and provides the best general usability and look-and-feel. Your solution should be a complete Macintosh application, so there is no prototype and no test code for this Challenge. Your submission should provide everything needed to build your application, as well as documentation of the features you have implemented, to ensure that I don't overlook anything.

Three Months Ago Winner

Only two people chose to enter the July DownNOut Challenge, and many-time champion Ernst Munter is once again our winner. The object of this Challenge was score as many points as possible while removing colored cells from a rectangular board. Cells are removed when they match the color of a selected cell and are connected to that cell via cells of the same color that are adjacent horizontally or vertically. The number of points earned for each move is the square of the number of cells removed, so there is an incentive to remove cells in the largest blocks possible. Solutions were required to display and update the game state after each move.

Ernst observes in his commentary that the time penalty discourages spending a lot of time searching alternative moves, so his solution relies on heuristics. His first step for each move is to identify all contiguous areas of cells (CreateAreas) and calculate their size. Next, he picks a target color for the move, with the objective of removing a large number of cells for that color in a later move. Ernst selects the color which has the smallest score based on the initial position of contiguous areas of cells, on the theory that removing the colors with larger initial contiguous areas will both score points and allow the smaller areas to coalesce. Once the target color is selected, Ernst tries to remove the smallest area of another color (GetSmallestArea1) that is nearest the top of the game board, and which has cells of the same color below it (a "shadow"). Failing that, he removes the smallest area of the target color. If no such areas are available, he chooses another target color and begins again.

I used a total of six test cases to evaluate the solutions, ranging in size from 8x25 to 20x40 cells, with 3, 4, or 5 cell colors. The table below lists, for each of the solutions submitted, the total number of points earned by removing cells over all test cases, the execution time in milliseconds, and the score. The score subtracts from the points earned a penalty of 1% for each millisecond of execution time, calculated individually for each test case. The table also lists the code size, data size, and programming language used for each entry. As usual, the number in parentheses after the entrant's name is the total number of Challenge points earned in all Challenges prior to this one.

Name Points Time Score
Ernst Munter (758) 91632 236 25337
J. T. 52666 4536 -561692
Name Code Data Lang
Ernst Munter 10028 458 C++
J. T. 7192 340 C

Top Contestants ...

Listed here are the Top Contestants for the Programmer's Challenge, including everyone who has accumulated 20 or more points during the past two years. The numbers below include points awarded over the 24 most recent contests, including points earned by this month's entrants.

Rank Name Points
(24 mo)
1. Munter, Ernst 271
2. Rieken, Willeke 73
3. Saxton, Tom 71
4. Taylor, Jonathan 56
5. Wihlborg, Claes 49
6. Shearer, Rob 48
7. Maurer, Sebastian 38
10. Mallett, Jeff 20
11. Truskier, Peter 20
Name Wins Total Points
(24 mo)
Munter, Ernst 10 778
Rieken, Willeke 3 134
Saxton, Tom 2 189
Taylor, Jonathan 2 56
Wihlborg, Claes 2 49
Shearer, Rob 1 62
Maurer, Sebastian 1 108
Mallett, Jeff 1 114
Truskier, Peter 1 20

...and the Top Contestants Looking for a Recent Win

In order to give some recognition to other participants in the Challenge, we also list the high scores for contestants who have accumulated points without taking first place in a Challenge during the past two years. Listed here are all of those contestants who have accumulated 6 or more points during the past two years.

Rank Name Points Total
(24 mo) Points
8. Boring, Randy 32 144
9. Sadetsky, Gregory 22 24
12. Schotsman, Jan 14 14
13. Nepsund, Ronald 10 57
14. Day, Mark 10 30
15. Downs, Andrew 10 12
16. Desch, Noah 10 10
17. Duga, Brady 10 10
18. Fazekas, Miklos 10 10
19. Flowers, Sue 10 10
20. Strout, Joe 10 10
21. Nicolle, Ludovic 7 55
22. Hala, Ladislav 7 7
23. Leshner, Will 7 7
24. Miller, Mike 7 7

There are three ways to earn points: (1) scoring in the top 5 of any Challenge, (2) being the first person to find a bug in a published winning solution or, (3) being the first person to suggest a Challenge that I use. The points you can win are:

1st place 20 points
2nd place 10 points
3rd place 7 points
4th place 4 points
5th place 2 points
finding bug 2 points
suggesting Challenge 2 points

Here is Ernst's winning DownNOut solution:

Copyright © 2001
Ernst Munter

Copyright © 2001, Ernst Munter, Kanata, ON, Canada.
A solitaire game where colored stones are placed in a vertical grid of rows and
columns. Adjacent stones of the same color form groups which can be removed as
long as a group contains at least two stones. After each move, consisting of the 
removal of a group of stones from one or more columns, remaining stones slide down 
in each column. Empty columns are filled by shifting ajacent columns towards the 
center. The score is the sum of the squares of the number of stones in each move. 

The standard game will have three colors with 100 stones each, on a board of 10 rows 
and 30 columns.

I select a target color and aim to make all the stones of of this color into a 
single contiguous group, by removing all groups of the other colors first.

As stones are removed, and others slide down, some groups may be separated and 
others newly formed. Hence, by careful play, and with some luck in picking the
right candidate, one can almost always assemble most of the stones of one color 
into one large group - when playing manually.

The time penalty in this challenge is 1% per millisecond of time. Hence, there is
not a lot of time for searches or backtracking. I have chosen to go with a few
heuristics which captures most of the stones in a single big move at the end (yielding 
a score of near 10,000), in about half of the games played. Just as often, however, 
it fails to provide a bridge, and the final pay-off is considerably less:

   ideally, 100 * 100 = 10,000, for a single move of all 100 stones of a color
   but 50 * 50 + 50 * 50 = 5,000 if two moves of 50 stones each are needed.
Display and Timing
The display of the board uses ColorQuickDraw PaintRect(), directly to the window.
A number of experiments with off-screen GWorlds did not result in any improvements.
The time to compute all the moves of a typical game is on the order of 2.5 msec, 
for a 2.5% penalty (display disabled); with the display on, the time increases
to 12.5msec overall. 
#define NDEBUG
#include <assert.h>
#include <stdlib.h>
#include "DownNout.h"

#define SHOWCELLS 1   // May be set to 0 for timing without the display

enum {
   kMaxNumColors   = 18,   // 16 cell colors + white + black
   kMaxCellSize   = 8,   // dont draw them larger than this
   kMinCellSize   = 2      //           or smaller than this

const RGBColor myColors[kMaxNumColors]={
   {0xFF00,0xFF00,0xFF00},   //white
   {0xFFFF,0x0000,0x0000},   //red
   {0x0000,0xFFFF,0x0000},   //green
   {0x0000,0x0000,0xFFFF},   //blue
   {0xFFFF,0xFFFF,0x0000},   //yellow
   {0xFFFF,0x0000,0xFFFF},   //pink
   {0x0000,0xFFFF,0xFFFF},   //light blue-1
   {0xFFFF,0x9999,0x3333},   //brown-1
   {0xFFFF,0x3333,0x9999},   //light purple
   {0x9999,0xFFFF,0x3333},   //light green
   {0x9999,0x3333,0xFFFF},   //violet
   {0x3333,0xFFFF,0x9999},   //emerald
   {0x3333,0x9999,0xFFFF},   //light blue-2
   {0xCCCC,0x9999,0x6666},   //brown-2
   {0x6666,0xCCCC,0xCCCC},   //blue-3
   {0xCCCC,0x6666,0xCCCC},   //purple
   {0x5F00,0x5F00,0x5F00},   //gray
   {0x0000,0x0000,0x0000}   //black

static long gCellSize;   // final size of squares for drawing
static WindowPtr win;   // the window provided by caller during InitDownNOut()

typedef long MyCellColor;   // faster than CellColor=char

/                     Class MyCell

class ColorSquare
// Defines the screen location and color of each cell, and draws it.
   Rect      rect;
   MyCellColor   color;
   void Init(const Point& spt,const MyCellColor cc,long cellSize)

   {;      // leave a 1-pixel white margin
   MyCellColor Color() const {return color;}
   void CopyColor(const MyCellColor xcolor) {color=xcolor;}
   void ClearColor() {color=0;}
   void Show()

/                     Class MyCell

class MyCell:public ColorSquare
// Defines the logical position on the board, and a few flags 

   long      tag;   // unique tag for each area
   short      row;   
   short      col;
   bool      seen;   // semaphore for recursive search
   bool      touch;   // indicates need to redraw this square

   void Init(const Point& spot,const MyCellColor cc,
          long rrow,long ccol,long cellSize)

   long    Row() const {return row;}
   long    Col() const {return col;}
   void Tag(long t) {tag=t;}
   bool IsTagged(const long t) const {return (tag==t);}
   void See() {seen=true;}
   bool IsSeen() const {return seen;}
   void UnSee() {seen=false;}
   void Touch() {touch=true;}
   bool IsBlank() const {return (Color()==0);}
   void CopyBack(CellColor* b) {*b=Color();}
   void CopyColor(const MyCell* x) 
      if (Color() != x->Color())
      } // else no change in color, no need to reassign or redraw
   void ClearColor() {
      if (Color() != 0)
      } // else no change in color, no need to reassign or redraw
   int CompPosition(MyCell* x)
// Comparison member function for qsort
      int dCol=col - x->col;// sort left to right
      if (dCol==0)
         return x->row - row;// and top to bottom
      return dCol;
   void   Show()
// Draws the cell if it has changed
      if (touch)




typedef MyCell* MyCellPtr;

static int CompCells(const void* a,const void* b)
// Comparison function for qsort
   MyCellPtr* ah=(MyCellPtr*)a;
   MyCellPtr* bh=(MyCellPtr*)b;
   MyCell* ap=*ah;
   MyCell* bp=*bh;
   return ap->CompPosition(bp);


/                     Class Area

class Area
// An area is identified with one of its cells, and describes the size
// of the area, i.e. the number of contiguous equal-colored cells.
   MyCell*   ref;      // pointer to one cell in the area
   long   size;      // number of cells in area
   void Init(MyCell* C,long areaSize)
   long Size() const {return size;}
   MyCellColor Color() const {return ref->Color();}
   MyCell* Cell() const {return ref;}
   void GetMove(short *moveRow,short *moveCol)
// The move is represented by the row/col coordinates of any area cell


typedef Area* AreaPtr;

/                     Class Player

class Player
// Player is the main structure holding data from initialization through moves
// Player also implements almost all the game logic, calling upon MyCell and Area
// classes for utility functions.
   long   nRows;
   long   nCols;
   long   nColors;

// My cells are stored in an array myBoard[col*nRows + row], arranged
//       to have sequential memory access for all cells in a column 

   MyCell*   myBoard;
   Area*   areas;
   long   numAreas;
// The cell list is allocated as a scratch pad for collecting the cells

//      to be removed at each move.

   MyCellPtr*   cellList;
   long   numInList;
// Move Number only serves as a source of unique tags for each move

   long    moveNr;
// A color is designated, to govern cell selection

   MyCellColor designatedColor;
   Player(long boardSizeRows,long boardSizeCols,long numColors,

         const CellColor board[],WindowPtr wdw) :
         new MyCell[sizeof(MyCell)*boardSizeRows*boardSizeCols]),
      areas(new Area[sizeof(Area)*(boardSizeRows*boardSizeCols)]),
         new MyCellPtr[sizeof(MyCellPtr)*

      long windowWidth=win->portRect.right-win->portRect.left;
      long windowHeight=win->portRect.bottom-win->;
      long squareWidth=windowWidth/nCols;
      long squareHeight=windowHeight/nRows;

      gCellSize=(squareWidth < squareHeight) ? 
                              squareWidth : squareHeight;
      if (gCellSize>kMaxCellSize)
      else if (gCellSize<kMinCellSize)
      delete [] cellList;
      delete [] areas;
      delete [] myBoard;
   void InitCells(const CellColor board[])

// Copies the CellColors of board[] to MyCells in myBoard[]

//   while rearranging the row/column sequence to be more convenient

      const CellColor* B=board;
      long cellSize=gCellSize;
      long   bottomRow=cellSize*(nRows-1);
      Point   spot={0,0};
      // will display row 0 at the bottom
      // will display col 0 at left
      for (long col=0;col<nCols;col++)
         for (long row=0;row<nRows;row++)
            const CellColor* B=&board[row*nCols + col];
            MyCell* C=&myBoard[col*nRows + row];
            spot.v    -=   cellSize;
         spot.h   +=   cellSize;
   void UpdateEvent(EventRecord theEvent)

// Checks validity of the event, and shows the entire board.

// Relies on caller to call BeginUpdate(..) and EndUpdate(..).

      if ((theEvent.what==updateEvt) && 
         // Touch all cells to ensure they are drawn
         for (int i=0;i<nRows*nCols;i++)

         // Draw the board

   void RemoveCells(long row,long col,long numToRemove)

// Shifts one column down; row 0 is at the bottom

      MyCell* dest=myBoard+col*nRows+row;
      MyCell* src=dest+numToRemove;
      MyCell* end=myBoard+(col+1)*nRows;
      while (src<end)
      while (dest<end)
   void ShowRange(long firstCol,long numColsToShow)

// Shows all cells which have been touched

      if (!SHOWCELLS)
      GrafPtr   savePort;
      GetPort (&savePort);
      MyCell* C=myBoard + firstCol*nRows;
      for (int i=0;i<numColsToShow*nRows;i++)
      SetPort (savePort);
   Area* GetSmallestArea1(const MyCellColor avoidColor)

// Returns the smallest area, not of "avoidColor", nearest the top, and which has a 

// shadow. 

      long smallestSize=nCols*nRows;
      Area* bestArea=0;
      long topRow=-1;
      for (int i=0;i<numAreas;i++)
         Area* A=&areas[i];
         if    (    (A->Size() <= smallestSize)
            &&   (A->Color() != avoidColor)
            && (A->Cell()->Row() > topRow) 
            &&   (Shadow(A->Cell(),A->Color()))
      return bestArea;
   bool Shadow(MyCell* C,const MyCellColor theColor) 

// Returns true if the area containing C is in the "shadow" of a cell of theColor,

// i.e. there is at least one cell of theColor above the area. 

      if (C->IsSeen())
         return false;
      long row=C->Row();
      long col=C->Col();
      if (Shade(C+1,C-row+nRows,theColor))
         return true;
      if ((row>0) 
         && ((-1)[C].Color()==theColor) 
         && Shadow(C-1,theColor))
            return true; 
      if ((row<nRows-1) 
         && ((1)[C].Color()==theColor)
         && Shadow(C+1,theColor))
            return true; 
      if ((col>0) 
         && ((-nRows)[C].Color()==theColor)
         && Shadow(C-nRows,theColor))
            return true; 
      if ((col<nCols-1)
         && ((nRows)[C].Color()==theColor)
         && Shadow(C+nRows,theColor))
            return true; 
      return false;
   bool Shade(MyCell* C,MyCell* end,const MyCellColor theColor)

// Checks the column of C and above.

// Returns true if it encounters a cell of theColor. 

      while ((C<end) && (C->Color()!=0))
         if ((C->Color()!=theColor))
            return true;
      return false;
   void UnSeeAll()
// Clears all "seen" flags.
      for (long i=0;i<nRows*nCols;i++)

   Area* GetSmallestArea2(const MyCellColor chosenColor)

// Returns the smallest area of the chosen color.


      long smallestSize=nCols*nRows;
      Area* bestArea=0;
      long bottomRow=nRows;
      for (int i=0;i<numAreas;i++)
         Area* A=&areas[i];
         if   (    (A->Size() < smallestSize) 
            &&   (A->Color() == chosenColor)
      return bestArea;
   long MeasureArea(MyCell* C,const MyCellColor theColor)

// All cells connected to C, and of the same color, are counted and tagged.

// Recursively collects all cells of one area and returns the size of the area.


      C->Tag(moveNr);   // uses the current move number as a unique tag

      long areaSize=1;
      long row=C->Row();
      long col=C->Col();
      if ((row>0) 
         && ((-1)[C].Color()==theColor) 
         && !(-1)[C].IsTagged(moveNr))
      if ((row<nRows-1) 
         && ((1)[C].Color()==theColor) 
         && !(1)[C].IsTagged(moveNr))
      if ((col>0) 
         && ((-nRows)[C].Color()==theColor) 
         && !(-nRows)[C].IsTagged(moveNr))
      if ((col<nCols-1) 
         && ((nRows)[C].Color()==theColor) 
         && !(nRows)[C].IsTagged(moveNr))
      return areaSize;
   long CreateAreas()

// The board is scanned and all contiguous areas are identified.

      long num=0;
      MyCell* C0=myBoard;
      for (long col=0;col<nCols;col++,C0+=nRows)
         MyCell* C=C0;
         for (long row=0;row<nRows;row++,C++)
            if (C->IsTagged(moveNr))
            if (C->IsBlank())   // reached top of active row
            long areaSize=MeasureArea(C,C->Color());
            if (areaSize >= 2)


      return num;
   long Play(CellColor board[],short *moveRow,short *moveCol)

// The main Play() function, called once per move.

// Plays one move and returns the number of cells removed.

// Identify all areas.
      if (numAreas==0) // game over !
         return 0;

// Ensure we have a target color.

      if (designatedColor==0)
// First choice: remove a small area of another color.
        Area* area=GetSmallestArea1(designatedColor);
                              //minimum area of unreserved color
      if (0==area)
// Second choice: remove smallest area of the chosen color.
                           //minimum area of reserved color
         if (0==area)
// Third choice: find a new color.
            goto choose_a_color;
// .. and do the removal.
      long numCellsRemoved=Execute(area,board,moveRow,moveCol);
      return numCellsRemoved;
   const MyCellColor ChooseColor()

// Chooses a color which we hope can be the color of a large area.

// The heuristic is to first remove all areas of other colors which are already more 
// coherent. This should then allow the smaller areas and single cells of the chosen 
// color to coalesce and form a larger single area.

      long score[kMaxNumColors];
      for (int i=1;i<=nColors;i++)
      for (int i=0;i<numAreas;i++)
         long color=areas[i].Color();
         long size=areas[i].Size();
      long lowestScore=nRows*nRows*nCols*nCols;
      MyCellColor chosenColor=0;
      for (int i=1;i<=nColors;i++)
          if ((score[i] > 0) && (score[i] < lowestScore))
      return chosenColor;
   long Execute(Area* area,CellColor board[],
                     short *moveRow,short *moveCol)
// Removes the selected area and returns its size.
      MyCellColor theColor=area->Color();
// Collect all cells of the area into a single list
// Sort the list, so that whole clumns can be removed if possible
// cells in list are sorted by col,row
// we'll remove cells by col, row, num rows in col
      long minCol=nCols;
      long maxCol=-1;
      for (int i=0;i<numInList;i++)
         MyCell* C=cellList[i];
         long row=C->Row();
         long col=C->Col();
         long n=1;
         // count number of contiguous cells in column for removal
         for (int k=i+1;k<numInList;k++,n++)
            long nextRow=row-1;
            if ((cellList[k]->Col() != col) || 
                        (cellList[k]->Row() != nextRow))

// Remember column range
         if (maxCol < col) maxCol=col;
         if (minCol > col) minCol=col;

// If any empty cols result, move cols towards center, extend range
//      .. from the right

      for (long col=maxCol;(col>=(nCols-nCols/2)) && 
         if (IsEmptyColumn(col))
//      .. and from the left
      for (long col=minCol;(col<=nCols/2) && (col<=maxCol);col++)
         if (IsEmptyColumn(col))

// Display all touched cells in range

// Let the caller know what happened: update his board[]

//    .. and return the number of cells removed.

      return numInList;
   void CopyBackBoard(CellColor board[],long firstCol,long numColsToShow)

// Copies the cell colors of myBoard[] to the callers board[]

// Note the different array indexing.

      MyCell* C=&myBoard[firstCol*nRows];
      for (long col=firstCol;col<firstCol+numColsToShow;col++)
         for (long row=0;row<nRows;row++,C++)
            CellColor* B=&board[row*nCols + col];
   bool IsEmptyColumn(long col)
// Returns true if the first cell in a column is blank (white)
      return (myBoard[col*nRows].IsBlank());
   void ShiftRight(long destCol)
// Shifts all columns left of destCol to the right by one position
      long minCol=0;
      for (;minCol<destCol;minCol++)
         if (!IsEmptyColumn(minCol))
      for (long srcCol=destCol-1;srcCol>=minCol;srcCol—,destCol—)
   void ShiftLeft(long destCol)
// Shifts all columns right of destCol to the left by one position
      long maxCol=nCols-1;
      for (;maxCol>destCol;maxCol—)
         if (!IsEmptyColumn(maxCol))
      for (long srcCol=destCol+1;srcCol<=maxCol;srcCol++,destCol++)
   void CopyColumn(long destCol,long srcCol)
// Copies one column from bottom row up, stopping when both are blank 
      MyCell* dest=&myBoard[destCol*nRows];
      MyCell* src=&myBoard[srcCol*nRows];
      for (long row=0;row<nRows;row++)
         if ((dest[row].IsBlank()) && (src[row].IsBlank()))
   void ClearColumn(long col)
// Clears a column from bottom row up, stopping at first blank row
      MyCell* dest=&myBoard[col*nRows];
      MyCell* end=dest+nRows;
      while (dest<end)
         if (dest->IsBlank())
   void MakeList(MyCell* C,const MyCellColor theColor)
// Scans an area recursively, and puts a reference to each cell into cellList.
      long row=C->Row();
      long col=C->Col();
      if ((row>0) 
         && ((-1)[C].Color()==theColor) 
         && !(-1)[C].IsTagged(0))
      if ((row<nRows-1) 
         && ((1)[C].Color()==theColor) 
         && !(1)[C].IsTagged(0))
      if ((col>0) 
         && ((-nRows)[C].Color()==theColor) 
         && !(-nRows)[C].IsTagged(0))
      if ((col<nCols-1) 
         && ((nRows)[C].Color()==theColor) 
         && !(nRows)[C].IsTagged(0))

static Player*    P=0;

/                  External Functions

void InitDownNOut(
 short boardSizeRows, /* number of rows in the game */
 short boardSizeCols, /* number of columns in the game */
 short numColors,   /* number of colors in the game */
 const CellColor board[],
  /* board[row*boardSizeCols + col] is color of cell at [row][col] */
 WindowPtr gameWindow
  /* window where results of your moves should be displayed */
   if ((boardSizeRows>0) 
      && (boardSizeCols>0) 
      && (numColors>=1)
      && (numColors+2<=kMaxNumColors) )
   P=new Player(boardSizeRows,boardSizeCols,numColors,board,gameWindow);

void HandleUpdateEvent(EventRecord theEvent)
   if (P) P->UpdateEvent(theEvent);

Boolean /* able to play */ PlayOneDownNOutMove(
   long score,         /* points earned prior to this move */
   CellColor board[],   /* board[row*boardSizeCols + col] is color of cell at [row][col] */
   short *moveRow,      /* return row of your next move */
   short *moveCol,      /* return col of your next move */
   long *numberOfCellsRemoved   /* self explanatory */
#pragma unused(score)
   if (P)
      long numCellsRemoved=
      if (numCellsRemoved>0)
         return true;
   return false;

void TermDownNOut(void) 
   delete P; 
// Deletes the only visible variable which in turn destroys its allocated data members.

Community Search:
MacTech Search:

Software Updates via MacUpdate

OmniOutliner Pro 4.2 - Pro version of th...
OmniOutliner Pro is a flexible program for creating, collecting, and organizing information. Give your creativity a kick start by using an application that's actually designed to help you think. It's... Read more
VLC Media Player 2.2.1 - Popular multime...
VLC Media Player is a highly portable multimedia player for various audio and video formats (MPEG-1, MPEG-2, MPEG-4, DivX, MP3, OGG, ...) as well as DVDs, VCDs, and various streaming protocols. It... Read more
Nisus Writer Pro 2.1.1 - Multilingual wo...
Nisus Writer Pro is a powerful multilingual word processor, similar to its entry level products, but brings new features such as table of contents, indexing, bookmarks, widow and orphan control,... Read more
Tinderbox 6.2.0 - Store and organize you...
Tinderbox is a personal content management assistant. It stores your notes, ideas, and plans. It can help you organize and understand them. And Tinderbox helps you share ideas through Web journals... Read more
OmniOutliner 4.2 - Organize your ideas,...
OmniOutliner is a flexible program for creating, collecting, and organizing information. Give your creativity a kick start by using an application that's actually designed to help you think. It's... Read more
Things 2.5.4 - Elegant personal task man...
Things is a task management solution that helps to organize your tasks in an elegant and intuitive way. Things combines powerful features with simplicity through the use of tags and its intelligent... Read more
NeoOffice 2014.10 - Mac-tailored, OpenOf...
NeoOffice is a complete office suite for OS X. With NeoOffice, users can view, edit, and save OpenOffice documents, PDF files, and most Microsoft Word, Excel, and PowerPoint documents. NeoOffice 3.x... Read more
iPhoto Library Manager 4.2 - Manage mult...
iPhoto Library Manager allows you to organize your photos among multiple iPhoto libraries, rather than having to store all of your photos in one giant library. You can browse the photos in all your... Read more
Web Snapper 3.3.8 - Capture entire Web p...
Web Snapper lets you capture Web pages exactly as they appear in your browser. You can send them to a file as images or vector-based, multi-page PDFs. It captures the whole Web page - eliminating the... Read more
TeamViewer 10.0.41404 - Establish remote...
TeamViewer gives you remote control of any computer or Mac over the Internet within seconds, or can be used for online meetings. Find out why more than 200 million users trust TeamViewer! Free for... Read more

The Apple Watch Could Revolutionize the...
It’s not here yet but there’s that developing sneaky feeling that the Apple Watch, despite its price tag and low battery life, might yet change quite a lot about how we conduct our lives. While I don’t think it’s going to be an overnight... | Read more »
Mad Skills Motocross 2 Version 2.0 is He...
Mad Skills Motocross 2 fans got some good news this week as Turborilla has given the game its biggest update yet. Now you'll have access to Versus mode where you can compete against your friends in timed challenges. Turborilla has implemented a... | Read more »
Kids Can Practice Healthy Living With Gr...
Bobaka is releasing a new interactive book called Green Riding Hood  in May. The app teaches kids about yoga and organic style of life through mini-games and a fun take on the classic Little Red Riding Hood fairy tale. | Read more »
Chainsaw Warrior: Lords of the Night has...
It's time to put the Darkness back in its place now that Chainsaw Warrior: Lords of the Night has officially made it to iOS. | Read more »
A World of Ice and Fire Lets You Stalk 2...
George R. R. Martin’s A World of Ice and Fire, by Random House, is a mobile guide to the epic series. The new update gives you the Journeys map feture that will let you track the movements of 25 different characters. But don't worry, you can protect... | Read more »
Gameloft Announces Battle Odyssey, a New...
Battle Odyssey, Gameloft's newest puzzle RPG, is coming to the App Store next week. Set in the world of Pondera, you will need to control the power of the elements to defend the world from evil. You'll be able to entlist over 500 allies to aid you... | Read more »
Here's How You Can Get 5 Free Pro D...
It's only been a couple of days since Gamevil released MLB Perfect Inning 15, so building up a decent roster could still take a little time. If you'd like to speed things up a bit, then we've got a deal for you. How does five free Pro drafts sound?... | Read more »
Fusion - HDR Camera (Photography)
Fusion - HDR Camera 1.0.0 Device: iOS Universal Category: Photography Price: $1.99, Version: 1.0.0 (iTunes) Description: Fusion creates HDR (high dynamic range) photos by capturing different exposures and then combining them into one... | Read more »
Sago Mini Toolbox (Education)
Sago Mini Toolbox 1.1 Device: iOS Universal Category: Education Price: $2.99, Version: 1.1 (iTunes) Description: Come build with the Sago Mini friends! Use a wrench, try a saw, or hammer some nails. From sewing hand puppets to... | Read more »
You Should Probably Grab Hitman GO While...
Hitman GO is a surprisingly cool (yet also incredibly drastic) departure from the Hitman series. It's well worth playing for any puzzle game fans out there, and at the moment you can get your hands - or garrotte if you will - on it for a mere $0.99... | Read more »

Price Scanner via

TigerText Introduces First Secure Enterprise...
TigerText, a provider of secure, real-time messaging for the enterprise, has announced the launch of TigerText for the Apple Watch. TigerText for the Apple Watch enables users to securely send and... Read more
The Conservation Fund Partners with Apple To...
The Conservation Fund has announced that it will partner with Apple to help protect working forests in the United States. The Apple initiative will conserve more than 36,000 acres of working... Read more
Clearance 13-inch 2.6GHz Retina MacBook Pro a...
B&H Photo has clearance 2014 13″ 2.6GHz/128GB Retina MacBook Pros now available for $1099, or $200 off original MSRP. Shipping is free, and B&H charges NY sales tax only. Read more
Apple refurbished 2014 13-inch Retina MacBook...
The Apple Store has Apple Certified Refurbished 2014 13″ Retina MacBook Pros available for up to $400 off original MSRP, starting at $979. An Apple one-year warranty is included with each model, and... Read more
iMacs on sale for up to $205 off MSRP, NY tax...
B&H Photo has 21″ and 27″ iMacs on sale for up to $205 off MSRP including free shipping plus NY sales tax only: - 21″ 1.4GHz iMac: $1019 $80 off - 21″ 2.7GHz iMac: $1189 $110 off - 21″ 2.9GHz... Read more
Sale! 16GB iPhone 5S for $1 with service
Best Buy is offering 16GB iPhone 5Ss for $1.00 with 2-year activation at a participating cellular provider. Choose free home shipping and activation, or buy online and activate during in-store pickup... Read more
Apple refurbished 2014 MacBook Airs available...
The Apple Store has Apple Certified Refurbished 2014 MacBook Airs available starting at $679. An Apple one-year warranty is included with each MacBook, and shipping is free. These are currently the... Read more
27-inch 3.5GHz 5K iMac on sale for $2349, sav...
 Adorama has the 27″ 3.5GHz 5K iMac in stock today and on sale for $2349 including free shipping plus NY & NJ sales tax only. Their price is $150 off MSRP. For a limited time, Adorama will... Read more
Save up to $380 on an iMac with Apple refurbi...
The Apple Store has Apple Certified Refurbished iMacs available for up to $380 off the cost of new models. Apple’s one-year warranty is standard, and shipping is free: - 27″ 3.5GHz 5K iMac – $2119 $... Read more
iFixIt Teardown Awards 12-IInch Retina MacBoo...
iFixIt has posted its illustrated teardown of the new 12-inch MacBook Retina. They note that this new MacBook is less than half the thickness of the last Apple notebook called just “MacBook” back in... Read more

Jobs Board

Sr. Project Engineer, *Apple* Education Pro...
**Job Summary** Apple Professional Services (APS) has an opening for a senior technical position that contributes to Apple 's efforts for strategic and transactional Read more
Event Director, *Apple* Retail Marketing -...
…This senior level position is responsible for leading and imagining the Apple Retail Team's global engagement strategy and team. Delivering an overarching brand Read more
*Apple* Retail - Multiple Positions (US) - A...
Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, you're also the Read more
Communication Manager - *Apple* Pay - Apple...
**Job Summary** This position works within the Apple Pay Merchant Solutions team to create, as well as oversee the development of, materials for use by Apple Pay Read more
Project Manager / Business Analyst, WW *Appl...
…a senior project manager / business analyst to work within our Worldwide Apple Fulfillment Operations and the Business Process Re-engineering team. This role will work Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.