TweetFollow Us on Twitter

Jan 96 Challenge
Volume Number:12
Issue Number:1
Column Tag:Programmer’s Challenge

Programmer’s Challenge

By Bob Boonstra, Westford, Massachusetts

Note: Source code files accompanying article are located on MacTech CD-ROM or source code disks.

Sliding Tiles

You have all probably seen small versions of the puzzle that is the basis for this month’s Challenge: a 4-by-4 grid of interlocking tiles, with one empty tile among the 16 cells allowing the puzzle to be scrambled by sliding adjacent cells into the empty location. This month the Challenge is to write code that will unscramble a larger version of the Sliding Tiles puzzle.

The prototype for the code you should write is:

typedef Boolean  /*legalMove*/ (*MoveProc)(
                     /* Callback procedure to move tile at                 */
  long tileToMoveRow,/*   these coordinates into the location              */
  long tileToMoveCol /*   of adjacent empty tile                      */
);
  
void SolveTiles(
  long *tiles,      /* pointer to array of tiles where            */
  long numRows,     /*   tile (row,col) is at                  */
  long numCols,     /*   *(tiles + row*numCols + col)             */
  MoveProc MakeMove /* Callback procedure to move a tile                      */
);

You will be given a pointer tiles into an array of tile values, the number of rows and columns in the puzzle (numRows and numCols, respectively), and the address of a callback procedure MakeMove used to tell my test code about the moves you make to solve the puzzle. The tiles array will be initialized with the values 0..numRows*numCols-1, in an order scrambled by the calling routine. The value 0 represents the empty tile.

Your code should make a sequence of calls to MakeMove and return when the puzzle is solved. Each MakeMove call exchanges the empty tile with the indicated adjacent tile. The puzzle is solved when you have moved each tile into its proper location: moving the tile with value i into location tiles[i] (i.e., row=i/numCols and col=i%numCols).

The callback routine will be something like the code provided below:

static long gNumRows,gNumCols;    /* initialized by test code */
static long gEmptyRow,gEmptyCol;  /* initialized by test code */
static long *gTiles;              /* initialized by test code */

#define TileValue(tiles,row,col) *(tiles+(row)*gNumCols+(col))
#define OutOfRange(val,num)  (((val)<0) || ((val)>=(num)))
  
static Boolean MakeMove(long tileToMoveRow,long tileToMoveCol) 
{
  long diff;
  if (OutOfRange(tileToMoveRow,gNumRows)) return false;
  if (OutOfRange(tileToMoveCol,gNumCols)) return false;
  if (tileToMoveRow == gEmptyRow) {
    diff = tileToMoveCol - gEmptyCol;
  } else if (tileToMoveCol == gEmptyCol) {
    diff = tileToMoveRow - gEmptyRow;
  } else {
    return false;
  }
  if ((diff != -1) && (diff != 1)) return false;
  TileValue(gTiles,gEmptyRow,gEmptyCol) = 
    TileValue(gTiles,tileToMoveRow,tileToMoveCol);
  gEmptyRow = tileToMoveRow;
  gEmptyCol = tileToMoveCol;
  TileValue(gTiles,gEmptyRow,gEmptyCol) = 0;
}

As an example, given the initial conditions:

         long tiles[] = {1,4,0,3,5,2};
         SolveTiles(tiles,2,3,MakeMove);

you could generate the following moves:

         MakeMove(1,2);
         MakeMove(1,1);
         MakeMove(0,1);
         MakeMove(0,0);

to transform the puzzle like this:

        1 4 0  ==>  1 4 2  ==>  1 4 2  ==>  1 0 2  ==>  0 1 2
        3 5 2       3 5 0       3 0 5       3 4 5       3 4 5

It turns out that half of the possible permutations of the values 0..numRows*numCols-1 are “illegal” in that they cannot be reached from the “solved” state. The calling routine will provide a legal starting state - you don’t have to worry about the puzzle being unsolvable.

The number of moves you make to solve the puzzle is not an explicit criterion in determining the winner, but the winner will be determined by total execution time, including the time used by the callback routine, as we did in the Master MindReader challenge a few months back. Note that you are not permitted to optimize the callback routine - its purpose is to provide a fixed time penalty for each move your solution routine makes.

This will be a native PowerPC Challenge, scored using the Symantec 8.0.3 compiler. Good luck. Email me with any questions, or - better yet - join the Programmer’s Challenge Mailing List

Mailing List Reminder

Many Challenge readers have already joined the Programmer’s Challenge Mailing List announced last month. The list is being used to distribute the latest Challenge, provide answers to questions about the current Challenge, and discuss suggestions for future Challenges. The Challenge problem is posted to the list sometime between the 20th and the 25th of the month.

To subscribe to the list, send a message to autoshare@mactech.com with the SUBJECT line “sub challenge YourName”, substituting your real name for YourName. To unsubscribe from the list, send a message to autoshare@mactech.com with the SUBJECT line “unsub challenge”.

Two Months Ago Winner

Congratulations to Eric Lengyel (Blacksburg, VA) for submitting the fastest entry to the EnclosingBounds Challenge. The problem was to find the smallest rectangle enclosing all of the non-white pixels in a PixMap. Eight of the 13 entries submitted worked correctly, but Eric’s solution was significantly faster than the others. This is Eric’s second victory in three months, following his first-place finish in the September Reversible Scrambling Algorithm Challenge.

The winning solution uses a clever technique to minimize the number of comparisons required to find the enclosing rectangle. Rather than test each pixel to determine if it is non-white, Eric logically ORs the values for all pixels in a row (for the indexed color cases), taking advantage of the fact that white is always represented by a zero value. A single comparison then determines whether that row contains only white pixels. Working separately from the top and bottom of the selection rectangle identifies the top and bottom rows of the enclosing rectangle. A similar technique applied to columns finds the left and right boundaries of the rectangle. For the direct (32-bit) color case, the approach is similar, except that pixel values in a row or column are logically ANDed, taking advantage of the fact that white is represented by the value 0x00FFFFFF.

Here are the times and code sizes for each of the correct entries. Numbers in parentheses after a person’s name indicate that person’s cumulative point total for all previous Challenges, not including this one.

Name time time time test code data
1-bit 8-bit 32-bit time size size

Eric Lengyel (20) 13 66 272 340 1608 320

Ernst Munter (100) 22 96 326 427 2980 32

Miguel Cruz Picao 34 110 476 593 3328 44

John Sweeney 75 145 502 659 4416 624

Bill Karsh (78) 54 135 517 662 1600 8

Tom Saxton 146 170 560 758 1044 132

Chris Rudolph 514 289 973 1354 1420 8

P.L. 6197 4672 5384 11181 656 24

The times listed above were all achieved using the Metrowerks CodeWarrior 7 compiler. Running the winning entry with code generated by the Symantec and MrC compilers (with all speed optimizations enabled in each case) gave some interesting results, with the MrC code executing in 2/3 to 3/4 of the time required by the others:

Compiler (version) time time time
1-bit 8-bit 32-bit

MrC / MPW (1.0f2) 10 52 183

Metrowerks C (1.3.2) 13 66 272

Symantec (8.0.3) 17 75 292

An investigation of the generated code provides some insight into these numbers. CodeWarrior generates the following code for one of the inner loops in the winning solution:

         for (i = 0; i < numWholeWords; i++)
00000064: 7D274B78  mr       r7,r9
00000068: 38A00000  li       r5,0
0000006C: 48000014  b        *+20     ; $00000080
         {
            accumulator |= *(long *) k;
            k += 4;
         }
00000070: 80070000  lwz      r0,0(r7)
00000074: 38A50001  addi     r5,r5,1
00000078: 7C630378  or       r3,r3,r0
0000007C: 38E70004  addi     r7,r7,4
00000080: 7C052000  cmpw     r5,r4
00000084: 4180FFEC  blt      *-20     ; $00000070

By comparison, MrC generates the following longer, but faster code:

         for (i = 0; i < numWholeWords; i++)
00F8 006C     48000018   b         $+0x0018      ; 0x00000084
00FC 0070   X 4E800020   blr
0100 0074     31290001   addic     r9,r9,1
0104 0078     7D4A3814   addc      r10,r10,r7
0108 007C   X 7C093000   cmpw      r9,r6
010C 0080   X 4080FFF0   bge       $-0x0010      ; 0x00000070
0110 0084   X 40990028   ble       cr6,$+0x0028  ; 0x000000AC
0114 0088   X 7D0903A6   mtctr     r8            ; CTR = 9
0118 008C   X 2C080001   cmpwi     r8,1
011C 0090   X 4181000C   bgt       $+0x000C      ; 0x0000009C
0120 0094   X 38600001   li        r3,1
0124 0098   X 7C6903A6   mtctr     r3            ; CTR = 9
0128 009C   X 318AFFFC   subic     r12,r10,4
         {
            accumulator |= *(long *) k;
            k += 4;
         }
012C 00A0     846C0004   lwzu      r3,0x0004(r12)
0130 00A4     7C6B5B78   or        r11,r3,r11
0134 00A8   X 4200FFF8   bdnz      $-0x0008      ; 0x000000A0

Notice that the inner loop is 6 instructions in the CodeWarrior version but only 3 instructions in the MrC code. The key to the difference is the use of the mtctr, lwzu, and bdnz instructions. The mtctr instruction loads the special purpose CTR register, which the bdnz instruction decrements and tests, branching when CTR is nonzero (similar to what the DBRA instruction does on 68K machines). The bdnz instruction replaces 3 instructions generated by CodeWarrior. The lwzu instruction loads a value from memory, but also stores the effective address back into the register used for the indirect memory access, replacing 2 CodeWarrior instructions. Reading disassembled compiler-optimized PowerPC code takes a little practice, but it can provide some insight into what the compiler is doing to you (or for you). Those interested in learning more are referred to the many PowerPC articles in past issues of MacTech, including a two part series by Bill Karsh in August and September of 1994.

Top Contestants of All Time

Here are the Top Contestants for the Programmer’s Challenges to date, including everyone who has accumulated more than 20 points. The numbers below include points awarded for this month’s entrants.

Rank Name Points Rank Name Points

1. [Name deleted] 176 11. Mallett, Jeff 44

2. Munter, Ernst 110 12. Kasparian, Raffi 42

3. Gregg, Xan 81 13. Vineyard, Jeremy 42

4. Karsh, Bill 80 14. Lengyel, Eric 40

5. Larsson, Gustav 67 15. Darrah, Dave 31

6. Stenger, Allen 65 16. Landry, Larry 29

7. Riha, Stepan 51 17. Elwertowski, Tom 24

8. Goebel, James 49 18. Lee, Johnny 22

9. Nepsund, Ronald 47 19. Noll, Robert 22

10. Cutts, Kevin 46

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 5th place 2 points

2nd place 10 points finding bug 2 points

3rd place 7 points suggesting Challenge 2 points

4th place 4 points

Here is Eric’s winning solution:

EnclosingBounds

Copyright © 1995 Eric Lengyel

/*
  This algorithm is based on the following idea.  Assuming that we are going to have to
  check many rows or columns which don’t contain any non-white pixels, it is faster to 
  combine all of the pixels in a row or column and look at the end result than it is to 
  check each pixel individually.  This is done by ORing entire rows or columns 
  together for 1-bit and 8-bit deep pixel maps and ANDing entire rows or columns 
  together for 32-bit deep pixel maps.  The two different methods are necessary 
  because for 1-bit and 8-bit pixel maps, white is represented by zeros and for 32-bit 
  pixel maps, white is represented by ones.

  The mask tables below are used with 1-bit and 8-bit deep pixel maps.  They are 
  needed when the left or right side of the selection rectangle is not word aligned.
*/

long LeftMask1[32] =
   {0xFFFFFFFF, 0x7FFFFFFF, 0x3FFFFFFF, 0x1FFFFFFF,
    0x0FFFFFFF, 0x07FFFFFF, 0x03FFFFFF, 0x01FFFFFF,
    0x00FFFFFF, 0x007FFFFF, 0x003FFFFF, 0x001FFFFF,
    0x000FFFFF, 0x0007FFFF, 0x0003FFFF, 0x0001FFFF,
    0x0000FFFF, 0x00007FFF, 0x00003FFF, 0x00001FFF,
    0x00000FFF, 0x000007FF, 0x000003FF, 0x000001FF,
    0x000000FF, 0x0000007F, 0x0000003F, 0x0000001F,
    0x0000000F, 0x00000007, 0x00000003, 0x00000001};

long RightMask1[32] =
   {0x80000000, 0xC0000000, 0xE0000000, 0xF0000000,
    0xF8000000, 0xFC000000, 0xFE000000, 0xFF000000,
    0xFF800000, 0xFFC00000, 0xFFE00000, 0xFFF00000,
    0xFFF80000, 0xFFFC0000, 0xFFFE0000, 0xFFFF0000,
    0xFFFF8000, 0xFFFFC000, 0xFFFFE000, 0xFFFFF000,
    0xFFFFF800, 0xFFFFFC00, 0xFFFFFE00, 0xFFFFFF00,
    0xFFFFFF80, 0xFFFFFFC0, 0xFFFFFFE0, 0xFFFFFFF0,
    0xFFFFFFF8, 0xFFFFFFFC, 0xFFFFFFFE, 0xFFFFFFFF};

long LeftMask8[4] =
   {0xFFFFFFFF, 0x00FFFFFF, 0x0000FFFF, 0x000000FF};

long RightMask8[4] =
   {0xFF000000, 0xFFFF0000, 0xFFFFFF00, 0xFFFFFFFF};

long DirectWhite = 0x00FFFFFF;  // Value of white pixel
                                // in 32-bit map.

EnclosingBounds
void EnclosingBounds(PixMapHandle pm,
   Rect selection, Rect *enclosingRect)
{
   PixMapPtr   map;
   long        pixelSize, rowBytes, accumulator,
               leftMask, rightMask, baseAddr,
               leftSide, rightSide, topSide, bottomSide,
               numWholeWords, needLeftMask, needRightMask,
               i, j, k, l, m;

   map = *pm;

/*  Compute position of selection rectangle relative to upper-left corner of pixel map. */

   leftSide = selection.left - map->bounds.left;
   rightSide = selection.right - map->bounds.left;
   topSide = selection.top - map->bounds.top;
   bottomSide = selection.bottom - map->bounds.top;

/*  Check validity of selection rectangle.  */

   if ((rightSide <= leftSide) || (bottomSide <= topSide))
   {
      enclosingRect->left = enclosingRect->right =
         enclosingRect->top = enclosingRect->bottom = 0;
      return;
   }

/*  Determine characteristics of pixel map.  */

   rowBytes = map->rowBytes;
   if (rowBytes >= 0) pixelSize = 1;  // BitMap
   else pixelSize = map->pixelSize;   // PixelMap
   rowBytes &= 0x3FFF;                // Strip flags
   baseAddr = (long) map->baseAddr;

/*  Handle 1-bit and 8-bit deep pixel maps with same chunk
  of code.  32-bit deep pixel map handled separately.  */

   if (pixelSize != 32)
   {

/*  Move baseAddr over to the first column of the selection rectangle, still keeping it 
  word aligned.  Then determine what masks are needed for leftmost and rightmost 
  words in the selection and how many whole words there are in between.  */

      if (pixelSize == 1)
      {
         baseAddr += (leftSide >> 5) << 2;
         leftMask = LeftMask1[leftSide & 0x1F];
         rightMask = RightMask1[(rightSide - 1) & 0x1F];
         numWholeWords = (rightSide >> 5) -
            ((leftSide + 31) >> 5);
      }
      else
      {
         baseAddr += leftSide & 0xFFFC;
         leftMask = LeftMask8[leftSide & 3];
         rightMask = RightMask8[(rightSide - 1) & 3];
         numWholeWords = (rightSide >> 2) -
            ((leftSide + 3) >> 2);
      }

/*  Set flags indicating what masks are in use.  If the left and right boundaries of the 
  selection fall within the same word, then take the intersection of the left and right 
  masks and only consider one column of words.  */

      needLeftMask = (leftMask + 1 != 0);
      needRightMask = (rightMask + 1 != 0);
      if (numWholeWords < 0)
      {
         leftMask &= rightMask;
         needRightMask = 0;
      }

/*  Find first row with a non-white pixel by ORing the
  whole row together and checking for a non-zero result.  */

      j = topSide;
      accumulator = 0;
      m = baseAddr + j * rowBytes;  // Top-left corner
      do
      {
         k = m;
         if (needLeftMask)
         {
            accumulator |= (*(long *) k) & leftMask;
            k += 4;
         }
         for (i = 0; i < numWholeWords; i++)
         {
            accumulator |= *(long *) k;
            k += 4;
         }
         if (needRightMask)
         {
            accumulator |= (*(long *) k) & rightMask;
         }
         if (accumulator != 0) break;
         m += rowBytes;
      } while (++j < bottomSide);
      if (j == bottomSide)    // Whole selection is white
      {
         enclosingRect->left = enclosingRect->right =
            enclosingRect->top = enclosingRect->bottom = 0;
         return;
      }
                topSide = j;

/*  Find last row with a non-white pixel.  */

      j = bottomSide - 1;
      accumulator = 0;
      m = baseAddr + j * rowBytes;  // Bottom-left corner
      do
      {
         k = m;
         if (needLeftMask)
         {
            accumulator |= (*(long *) k) & leftMask;
            k += 4;
         }
         for (i = 0; i < numWholeWords; i++)
         {
            accumulator |= *(long *) k;
            k += 4;
         }
         if (needRightMask)
         {
            accumulator |= (*(long *) k) & rightMask;
         }
         if (accumulator != 0) break;
         m -= rowBytes;
      } while (--j >= topSide);
      bottomSide = j + 1;

/*  Find leftmost column containing a non-white pixel.  */

      accumulator = 0;
      m = baseAddr + topSide * rowBytes;
      l = 0;
      if (needLeftMask)
      {
         k = m;
         j = topSide;
         do
         {
            accumulator |= (*(long *) k) & leftMask;
            k += rowBytes;
         } while (++j < bottomSide);
         if (accumulator != 0) goto leftFound;
         l += 4;
      }
      for (i = 0; i < numWholeWords; i++)
      {
         k = m + l;
         j = topSide;
         do
         {
            accumulator |= *(long *) k;
            k += rowBytes;
         } while (++j < bottomSide);
         if (accumulator != 0) goto leftFound;
         l += 4;
      }
      if (needRightMask)
      {
         k = m + l;
         j = topSide;
         do
         {
            accumulator |= (*(long *) k) & rightMask;
            k += rowBytes;
         } while (++j < bottomSide);
      }

/*  When we get to here, we have narrowed down the left-most non-white to the 
  word.  The value in the accumulator will tell us the exact column of the pixel.  We 
  then move baseAddr over to the last column of the selection rectangle (word 
  aligned).  */

leftFound:
      if (pixelSize == 1)
      {
         leftSide = (leftSide & 0xFFFFFFE0) + (l << 3);
         while (accumulator >= 0)
         {
            leftSide++;
            accumulator <<= 1;
         }
         baseAddr = (long) map->baseAddr +
            (((rightSide - 1) >> 5) << 2);
      }
      else
      {
         leftSide = (leftSide & 0xFFFFFFFC) + l;
         while ((accumulator & 0xFF000000) == 0)
         {
            leftSide++;
            accumulator <<= 8;
         }
         baseAddr = (long) map->baseAddr +
            ((rightSide - 1) & 0xFFFC);
      }

/*  Find rightmost column containing a non-white pixel.  */

      accumulator = 0;
      m = baseAddr + topSide * rowBytes;
      l = 0;
      if (needRightMask)
      {
         k = m;
         j = topSide;
         do
         {
            accumulator |= (*(long *) k) & rightMask;
            k += rowBytes;
         } while (++j < bottomSide);
         if (accumulator != 0) goto rightFound;
         l += 4;
      }
      for (i = 0; i < numWholeWords; i++)
      {
         k = m - l;
         j = topSide;
         do
         {
            accumulator |= *(long *) k;
            k += rowBytes;
         } while (++j < bottomSide);
         if (accumulator != 0) goto rightFound;
         l += 4;
      }
      if (needLeftMask)
      {
         k = m - l;
         j = topSide;
         do
         {
            accumulator |= (*(long *) k) & leftMask;
            k += rowBytes;
         } while (++j < bottomSide);
      }
rightFound:
      if (pixelSize == 1)
      {
         rightSide = ((rightSide + 31) & 0xFFFFFFE0) - (l << 3);
         while ((accumulator & 1) == 0)
         {
            rightSide--;
            accumulator >>= 1;
         }
      }
      else
      {
         rightSide = ((rightSide + 3) & 0xFFFFFFFC) - l;
         while ((accumulator & 0x000000FF) == 0)
         {
            rightSide--;
            accumulator >>= 8;
         }
      }
   }

/*  Now for the code which handles 32-bit deep pixel maps.  For direct pixels white is 
  ones, unlike indexed pixels where white is zeros.  We will use the same technique, 
  but we will have to AND the rows and columns together.  We don’t have to worry 
  about left and right masks - in 32-bit deep pixel maps every pixel is word aligned.  */

   else
   {
      baseAddr += leftSide << 2;
      numWholeWords = rightSide - leftSide;

/*  Find first row.  */

      j = topSide;
      accumulator = DirectWhite;
      m = baseAddr + j * rowBytes;
      do
      {
         k = m;
         i = 0;
         do
         {
            accumulator &= *(long *) k;
            k += 4;
         } while (++i < numWholeWords);
         if (accumulator != DirectWhite) break;
         m += rowBytes;
      } while (++j < bottomSide);
      if (j == bottomSide)       // All white pixels
      {
         enclosingRect->left = enclosingRect->right =
            enclosingRect->top = enclosingRect->bottom = 0;
         return;
      }
      topSide = j;

/*  Find last row.  */

      j = bottomSide - 1;
      accumulator = DirectWhite;
      m = baseAddr + j * rowBytes;
      do
      {
         k = m;
         i = 0;
         do
         {
            accumulator &= *(long *) k;
            k += 4;
         } while (++i < numWholeWords);
         if (accumulator != DirectWhite) break;
         m -= rowBytes;
      } while (--j >= topSide);
      bottomSide = j + 1;

/*  Find leftmost column.  */

      accumulator = DirectWhite;
      m = baseAddr + topSide * rowBytes;
      l = 0;
      i = 0;
      do
      {
         k = m + l;
         j = topSide;
         do
         {
            accumulator &= *(long *) k;
            k += rowBytes;
         } while (++j < bottomSide);
         if (accumulator != DirectWhite) break;
         l += 4;
      } while (++i < numWholeWords);
      leftSide += l >> 2;

/*  Find rightmost column.  */

      baseAddr = (long) map->baseAddr +
         (rightSide << 2) - 4;
      accumulator = DirectWhite;
      m = baseAddr + topSide * rowBytes;
      l = 0;
      i = 0;
      do
      {
         k = m - l;
         j = topSide;
         do
         {
            accumulator &= *(long *) k;
            k += rowBytes;
         } while (++j < bottomSide);
         if (accumulator != DirectWhite) break;
         l += 4;
      } while (++i < numWholeWords);
      rightSide -= l >> 2;
   }

/*  Return enclosing rectangle in the pixel map’s local coordinates.  */

   enclosingRect->left = leftSide + map->bounds.left;
   enclosingRect->right = rightSide + map->bounds.left;
   enclosingRect->top = topSide + map->bounds.top;
   enclosingRect->bottom = bottomSide + map->bounds.top;
}

 
AAPL
$116.47
Apple Inc.
+0.16
MSFT
$47.98
Microsoft Corpora
-0.72
GOOG
$537.50
Google Inc.
+2.67

MacTech Search:
Community Search:

Software Updates via MacUpdate

Cobook 3.0.7 - Intelligent address book....
Cobook Contacts is an intuitive, engaging address book. Solve the problem of contact management with Cobook Contacts and its simple interface and powerful syncing and integration possibilities.... Read more
StatsBar 1.9 - Monitor system processes...
StatsBar gives you a comprehensive and detailed analysis of the following areas of your Mac: CPU usage Memory usage Disk usage Network and bandwidth usage Battery power and health (MacBooks only)... Read more
Cyberduck 4.6 - FTP and SFTP browser. (F...
Cyberduck is a robust FTP/FTP-TLS/SFTP browser for the Mac whose lack of visual clutter and cleverly intuitive features make it easy to use. Support for external editors and system technologies such... Read more
Maya 2015 - Professional 3D modeling and...
Maya is an award-winning software and powerful, integrated 3D modeling, animation, visual effects, and rendering solution. Because Maya is based on an open architecture, all your work can be scripted... Read more
Evernote 6.0.1 - Create searchable notes...
Evernote allows you to easily capture information in any environment using whatever device or platform you find most convenient, and makes this information accessible and searchable at anytime, from... Read more
calibre 2.11 - Complete e-library manage...
Calibre is a complete e-book library manager. Organize your collection, convert your books to multiple formats, and sync with all of your devices. Let Calibre be your multi-tasking digital... Read more
Herald 5.0.1 - Notification plugin for M...
Note: Versions 2.1.3 (for OS X 10.7), 3.0.6 (for OS X 10.8), and 4.0.8 (for OS X 10.9) are no longer supported by the developer. Herald is a notification plugin for Mail.app, Apple's Mac OS X email... Read more
Firetask 3.7 - Innovative task managemen...
Firetask uniquely combines the advantages of classical priority-and-due-date-based task management with GTD. Stay focused and on top of your commitments - Firetask's "Today" view shows all relevant... Read more
TechTool Pro 7.0.6 - Hard drive and syst...
TechTool Pro is now 7, and this is the most advanced version of the acclaimed Macintosh troubleshooting utility created in its 20-year history. Micromat has redeveloped TechTool Pro 7 to be fully 64... Read more
PhotoDesk 3.0.1 - Instagram client for p...
PhotoDesk lets you view, like, comment, and download Instagram pictures/videos! (NO Uploads! / Image Posting! Instagram forbids that! AND you *need* an *existing* Instagram account). But you can do... Read more

Latest Forum Discussions

See All

Ubisoft Gives Everyone Two New Ways to E...
Ubisoft Gives Everyone Two New Ways to Earn In-Game Stuff for Far Cry 4 Posted by Jessica Fisher on November 21st, 2014 [ permalink ] | Read more »
Golfinity – Tips, Tricks, Strategies, an...
Dig this: Would you like to know what we thought of being an infinite golfer? Check out our Golfinity review! Golfinity offers unlimited ways to test your skills at golf. Here are a few ways to make sure your score doesn’t get too high and your... | Read more »
Dark Hearts, The Sequel to Haunting Meli...
Dark Hearts, The Sequel to Haunting Melissa, is Available Now Posted by Jessica Fisher on November 21st, 2014 [ permalink ] Universal App - Designed for iPhone and iPad | Read more »
Meowza! Toyze Brings Talking Tom to Life...
Meowza! | Read more »
Square Enix Announces New Tactical RPG f...
Square Enix Announces New Tactical RPG for Mobile, Heavenstrike Rivals. Posted by Jessica Fisher on November 21st, 2014 [ permalink ] With their epic stories and gorgeous graphics, | Read more »
Quest for Revenge (Games)
Quest for Revenge 1.0.0 Device: iOS Universal Category: Games Price: $4.99, Version: 1.0.0 (iTunes) Description: The great Kingdom of the west has fallen. The gods ignore the prayers of the desperate. A dark warlord has extinguished... | Read more »
Threadz is a New Writing Adventure for Y...
Threadz is a New Writing Adventure for You and Your Friends Posted by Jessica Fisher on November 21st, 2014 [ permalink ] In the tradition of round-robin storytelling, | Read more »
SteelSeries Stratus XL Hardware Review
Made by: SteelSeries Price: $59.99 Hardware/iOS Integration Rating: 4 out of 5 stars Usability Rating: 4.5 out of 5 stars Reuse Value Rating: 4.25 out of 5 stars Build Quality Rating: 4.5 out of 5 stars Overall Rating: 4.31 out of 5 stars | Read more »
ACDSee (Photography)
ACDSee 1.0.0 Device: iOS iPhone Category: Photography Price: $1.99, Version: 1.0.0 (iTunes) Description: Capture, perfect, and share your photos with ACDSee. The ACDSee iPhone app combines an innovative camera, a powerful photo... | Read more »
ProTube for YouTube (Entertainment)
ProTube for YouTube 2.0.2 Device: iOS Universal Category: Entertainment Price: $1.99, Version: 2.0.2 (iTunes) Description: ProTube is the ultimate, fully featured YouTube app. With it's highly polished design, ProTube offers ad-free... | Read more »

Price Scanner via MacPrices.net

Save up to $400 with Apple refurbished 2014 1...
The Apple Store has restocked Apple Certified Refurbished 2014 15″ Retina MacBook Pros for up to $400 off the cost of new models. An Apple one-year warranty is included with each model, and shipping... Read more
New 13-inch 1.4GHz MacBook Air on sale for $8...
 Adorama has the 2014 13″ 1.4GHz/128GB MacBook Air on sale for $899.99 including free shipping plus NY & NJ tax only. Their price is $100 off MSRP. B&H Photo has the 13″ 1.4GHz/128GB MacBook... Read more
Apple Expected to Reverse Nine-Month Tablet S...
Apple and Samsung combined accounted for 62 percent of the nearly 36 million branded tablets shipped in 3Q 2014, according to early vendor shipment share estimates from market intelligence firm ABI... Read more
Stratos: 30 Percent of US Smartphone Owners t...
Stratos, Inc., creator of the Bluetooth Connected Card Platform, has announced results from its 2014 Holiday Mobile Payments Survey. The consumer survey found that nearly one out of three (30 percent... Read more
2014 1.4GHz Mac mini on sale for $449, save $...
 B&H Photo has lowered their price on the new 1.4GHz Mac mini to $449.99 including free shipping plus NY tax only. Their price is $50 off MSRP, and it’s the lowest price available for this new... Read more
Check Apple prices on any device with the iTr...
MacPrices is proud to offer readers a free iOS app (iPhones, iPads, & iPod touch) and Android app (Google Play and Amazon App Store) called iTracx, which allows you to glance at today’s lowest... Read more
64GB iPod touch on sale for $249, save $50
Best Buy has the 64GB iPod touch on sale for $249 on their online store for a limited time. Their price is $50 off MSRP. Choose free shipping or free local store pickup (if available). Sale price for... Read more
15″ 2.2GHz Retina MacBook Pro on sale for $17...
 B&H Photo has the 2014 15″ 2.2GHz Retina MacBook Pro on sale for $1799.99 for a limited time. Shipping is free, and B&H charges NY sales tax only. B&H will also include free copies of... Read more
New Logitech AnyAngle Case/Stand Brings Flexi...
Logitec has announced the newest addition to its suite of tablet products — the Logitech AnyAngle. A protective case with an any-angle stand for iPad Air 2 and all iPad mini models, AnyAngle is the... Read more
Notebook PC Shipments Rise Year-Over-Year as...
According to preliminary results from the upcoming DisplaySearch Quarterly Mobile PC Shipment and Forecast Report, the global notebook PC market grew 10 percent year-over-year in Q3’14 to 49.4... Read more

Jobs Board

*Apple* Solutions Consultant (ASC)- Retail S...
**Job Summary** The ASC is an Apple employee who serves as an Apple brand ambassador and influencer in a Reseller's store. The ASC's role is to grow Apple Read more
Project Manager, *Apple* Financial Services...
**Job Summary** Apple Financial Services (AFS) offers consumers, businesses and educational institutions ways to finance Apple purchases. We work with national and Read more
*Apple* Store Leader Program - College Gradu...
Job Description: Job Summary As an Apple Store Leader Program agent, you can continue your education as you major in the art of leadership at the Apple Store. You'll 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
Senior Event Manager, *Apple* Retail Market...
…This senior level position is responsible for leading and imagining the Apple Retail Team's global event strategy. Delivering an overarching brand story; in-store, Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.