Jan 01 Challenge Volume Number: 17 (2001)
Issue Number: 1
Column Tag: Programmer's Challenge

By Bob Boonstra, Westford, MA

Tetris

When George Warner first suggested that I base a Challenge on Tetris, I was skeptical. I hadn't played Tetris in a long time, and my recollection was that Tetris is a game not only of strategy, but of manual dexterity as well. After some email conversation, however, I think we've found a way to formulate Tetris info a meaningful Challenge.

You remember how Tetris is played, right? The game is played on a board sized perhaps 10 cells wide and 20 cells high into which pieces of varying sizes are dropped. The player is able to move the pieces left or right as they drop, or to rotate them clockwise or counter-clockwise, or to drop them to the bottom of the board. The player accumulates points as each piece is positioned into its final location. As one or more rows become completely filled, those rows are removed, the other rows are shifted down, and more points are accumulated. As rows are deleted, the game progresses to higher and higher levels where the pieces drop faster and faster. The game continues until there is no room for the next piece to drop into the board.

In this month's Challenge version of Tetris, the board size is generalized to something potentially larger than 10x20, the game speed remains constant, and the game continues until a specified time limit expires. You can make one move of the current game piece, a translation or a rotation, for each tick of the game clock. You can take as long as you like to figure out the best move, but every microsecond you use to calculate your move subtracts from the time limit and reduces your opportunity to score additional points. So you need to plan your moves both carefully and quickly.

The prototype for the code you should write is:

```typedef char Piece[7][7];
/* aPiece[row][col] is 1 if aPiece occupies cell (row,col), 0 otherwise */

typedef char Board[256][256];
/* aBoard[row][col] is -1 if cell (row,col) is empty, otherwise it is the Piece index */
/* row 0 is the top row, col 0 is the leftmost column */

typedef enum {
kNoMove=0,                         /* allow piece to fall normally */
kMoveLeft, kMoveRight,         /* move piece left/right one column */
kDrop,                              /* drop piece to bottom of board */
kRotateClockwise,             /* rotate piece clockwise 90 degrees */
kRotateCounterClockwise      /* rotate piece counterclockwise 90 degrees */
} MoveType;

void InitTetris(
short boardWidth,               /* width of board in cells */
short boardHeight,            /* height of board in cells */
short numPieceTypes,         /* number of types of pieces */
const Piece gamePieces[],   /* pieces to play */
long timeToPlay                  /* game time, in milliseconds */
);

MoveType /* move active piece */ Tetris(
const Board gameBoard,
/* current state of the game board,
bottom row is [boardHeight-1], left column is [0] */
short activePieceTypeIndex,   /* index into gamePieces of active piece */
short nextPieceTypeIndex,      /* index into gamePieces of next piece */
long pointsEarned,               /* number of points earned thus far */
long timeToGo                        /* time remaining, in milliseconds */
);

void TermTetris(void);
```

The Tetris Challenge will work like this. Your InitTetris routine will be called first, to allow you to set up the problem based on the board configuration and the Piece shapes to be used in the problem. Next, your Tetris routine will be called multiple times, allowing you to manipulate the falling Tetris pieces, with the objective of accumulating as many points as possible. Your Tetris routine will continue to be called until the specified timeToPlay has expired, or until no more Pieces can be placed on the board. Then your TermTetris routine will be called, allowing you to deallocate any dynamically allocated storage.

InitTetris will be provided with the width (boardWidth) and height (boardHeight) of the game Board. It will also be given the numPieceTypes gamePieces to be used in the game, and the length of the game (timeToPlay) in milliseconds.

Each call to Tetris gives you the current state of the gameBoard; you should determine what you want to do with the active game Piece and return the corresponding MoveType. The test code will attempt to translate or rotate the active game Piece according to the MoveType you specify prior to dropping the Piece down one row. If the Piece cannot be moved or rotated as you request, the Piece will simply drop down one row. When the active Piece drops as far as it can, it will remain the active piece for one more game cycle, so that you can move it left or right by one position should you so choose. The Tetris parameters also provide you with the type of the next piece to be played (nextPieceTypeIndex), the pointsEarned so far, and the timeToGo still remaining in the game.

The gameBoard will contain the value -1 in each empty cell, and the index of the Piece occupying that cell for nonempty cells. Game Piece shapes are specified in a 7x7 array, with a 1 indicating that the corresponding cell is occupied. Pieces rotations occur about the central cell in that array. When Tetris is called with a new active game Piece, the Piece will be positioned just above the gameBoard, with the bottom row of the Piece due to appear on the gameBoard the next time Tetris is called.

The winner will be the solution that scores the most Tetris points within the specified timeToPlay. You score 1 point for each row that a Piece falls when it is dropped. When you eliminate a row, you earn 100 points. If multiple rows are completed at the same time, you win additional points: the second row completed by dropping a block is worth 200 points, the third 300 points, and the fourth 400 points. If you should eliminate all blocks on the board, you earn an additional 1000 points.

The Challenge prize will be divided between the overall winner and the best scoring entry from a contestant that has not won the Challenge recently. If you have wanted to compete in the Challenge, but have been discouraged from doing so, perhaps this is your chance at some recognition and a share of the Challenge prize.

This will be a native PowerPC Challenge, using the CodeWarrior Pro 6 environment. Solutions may be coded in C, C++, or Pascal. You can also provide a solution in Java, provided you also provide a test driver equivalent to the C code provided on the web for this problem.

Three Months Ago Winner

Congratulations to Ernst Munter (Kanata, Ontario) for another Programmer's Challenge victory. Ernst submitted the winning entry to the October "Which Bills Did They Pay" Challenge. This Challenge required contestants to sort out a set of invoices and a set of payments, matching payments to invoices. The solutions had to deal with payments that settled multiple invoices and partial payments of an invoice. Scoring was based on minimizing a "late-dollar-days" value that was the product of the amount of the invoice (or part of an invoice) times the number of days the amount went unpaid, thus encouraging the solution to apply payments to the oldest applicable invoice.

Ernst beat out the second-place entry by new contestant Sue Flowers. Sue's solution generated the same late-dollar-days value that Ernst's entry generated, but required significantly more execution time to do so. In several of the larger test cases, Sue's entry generated the same bill reconciliation log as Ernst's entry did, although this was not true in all cases. Besides Ernst's and Sue's entries, two additional entries for this Challenge were submitted, but neither solved the test cases correctly.

As always, Ernst's code is well commented. His entry makes two passes through the payment list, the first time looking for either a perfect match with a single invoice or a perfect match with multiple invoices. Ernst's CombineInvoices routine uses a stack-based technique to find the combination of invoices that exactly matches the payment amount. Although I didn't specifically analyze the performance of the individual routines in Ernst's code, I believe that the CombineInvoices routine is key to the performance Ernst achieved. In the second pass, his code looks for the "best" possible partial payment match, where "best" is defined as the invoice with the invoiced amount closest to the payment amount. Finally, the code makes a third pass through any remaining unpaid invoices to calculate the late-dollar-days statistic.

The table below lists, for each of the solutions submitted, the late-dollar-days value produced by the combined test cases, the cumulative execution time, and the number of reconciliation records generated. It also provides 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 \$Days Time (msecs) Records Errors? Code Size Data Size Lang Ernst Munter (661) 1829792 0.43 679 no 2756 180 C++ Sue Flowers 1829792 46.54 712 no 4156 233 C A.D. 44692680 0.78 11 yes 1272 24 C++ R. S. crash 13836 1775 C++

Top Contestants...

Listed here are the Top Contestants for the Programmer's Challenge, including everyone who has accumulated 10 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 1. Munter, Ernst 251 2. Saxton, Tom 96 3. Maurer, Sebastian 68 4. Rieken, Willeke 65 5. Boring, Randy 52 6. Shearer, Rob 48 7. Taylor, Jonathan 36 8. Wihlborg, Charles 29

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

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

 9 Downs, Andrew 12 10 Jones, Dennis 12 11 Day, Mark 10 12 Duga, Brady 10 13 Fazekas, Miklos 10 14 Flowers, Sue 10 15 Selengut, Jared 10 16 Strout, Joe 10 17 Hala, Ladislav 7 18 Miller, Mike 7 19 Nicolle, Ludovic 7 20 Schotsman, Jan 7 21 Widyyatama, Yudhi 7 22 Heithcock, JG 6

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 "What Bills Did They Pay" solution:

```WhichBills.cp
Ernst Munter

/*
October 4, 2000.
Submission to MacTech Programmer's Challenge for October 2000.

"What Bills Did They Pay"

The Problem
------
Reconcile a set of invoices and payments where invoices may be paid with more than one
instalment,  and where payments may cover several invoices.

The objective is to minimize the overall "late dollar days" subject to a set of rules.

The Solution
------
I tackle the problem in three passes over the lists of invoices and payments.  During the
first  and second phases, reconciled invoice and payment records are removed from the lists.

In the first pass, each payment may
- be perfectly matched to a single invoice,
- exactly match the sum of a number of invoices,
- not match.

In the second pass, any remaining payments are applied to the smallest available invoice.
This may still leave unmatched invoices or payments unreconciled.

The amount of "late dollar days" is the sum of each reconciled amount multiplied by the delay
between the invoice and the payment.

The "late dollar days" figure includes each of the remaining unmatched invoices, multiplied
by  the delay from the invoice date to the last payment date.

Any left-over payment that cannot be reconciled is disregarded.

Minimization of "late dollar days"
-----------------
If all payments have been accounted for, the resulting "late dollar days" number is
independent of the how the payments are applied to the invoices.  This is true because all
unpaid invoices  are effectively "paid" off on the last payment day.

The objective (to minimize "late dollar days") is thus achieved when all payments are matched
against invoices.  If this is not possible, it is best to
- minimize the number or amount of unmatched payments,
- leave the invoices that cannot be matched to as late a date as possible.

No exhaustive attempt is made of legal permutations of multiple and partial matches, to
eliminate ALL unmatched payments.  It is hoped that the heuristic approach comes fairly
close.
*/

#include "ReconcilePayments.h"

struct Calendar
// Linear calendar for calculating differences in days
const char months[12]={0,31,28,31,30,31,30,31,31,30,31,30};
static struct Calendar {
short startMonth[4][16];
Calendar()
{
for (long y=0;y<4;y++)
{
startMonth[y][1]=0;
startMonth[y][2]=months[1];
startMonth[y][3]=startMonth[y][2]+months[2];
if (y==0) startMonth[y][3]++;
for (long m=4;m <= 12;m++)
startMonth[y][m]=startMonth[y][m-1]+months[m-1];
}
}
} gCalendar;

// Converts a Macintosh 14-byte DateTimeRec into a long (resolution to days only).
inline long DayNumber(const DateTimeRec & x)
{
return
(1461*x.year-1)/4+
gCalendar.startMonth[3 & x.year][x.month] +
x.day;
}

struct MyInvoice
// My version of the invoice, using linear dates
struct MyInvoice {
long   amount;
long   day;
MyInvoice*   next;   // invoices are stored in a doubly linked list
MyInvoice*   prev;
long   number;
MyInvoice(){}
MyInvoice(MyInvoice* nxt,MyInvoice* prv) :
amount(0),   day(0),
next(nxt),   prev(prv),
number(0){}
MyInvoice(const Invoice & inv,MyInvoice* nxt,MyInvoice* prv) :
amount(inv.invoiceAmount),
day(DayNumber(inv.invoiceDate)),
next(nxt),
prev(prv),
number(inv.invoiceNumber){}
void Remove()
// bridges link pointers to remove invoice from the list it is on
{
if (next) next->prev=prev;
prev->next=next;
// prev is never 0 except in the list root which is never removed
}
};
typedef MyInvoice* MyInvoicePtr;

struct MyPayment
// My version of the payment, using linear dates
struct MyPayment {
long   amount;
long   day;
MyPayment*   next;         // payments are stored in a doubly linked list
MyPayment*   prev;
long   number;
MyInvoice*   mostRecentInvoice;   // .. relative to this payment
MyPayment(){}
MyPayment(MyPayment* nxt,MyPayment* prv) :
amount(0),   day(0),
next(nxt),   prev(prv),
number(0),   mostRecentInvoice() {}
MyPayment(const Payment & pay,MyPayment* nxt,MyPayment* prv) :
amount(pay.paymentAmount),
day(DayNumber(pay.paymentDate)),
next(nxt),   prev(prv),
number(pay.paymentNumber),
mostRecentInvoice() {}
void Remove()
{
if (next) next->prev=prev;
prev->next=next;
}
};
typedef MyPayment* MyPaymentPtr;

Count
inline
long Count(const Invoice theInvoices[])
// Counts the number of invoices, up to the sentinel with invoiceNumber 0
{
const Invoice* I=theInvoices-1;
long n=0;
while ((++I)->invoiceNumber) {n++;}
return n;
}

inline
long Count(const Payment thePayments[])
// Counts the number of payments, up to the sentinel with paymentNumber 0
{
const Payment* P=thePayments-1;
long n=0;
while ((++P)->paymentNumber) {n++;}
return n;
}

Reconcile
inline
long Reconcile(long amount,Reconciliation & R,
MyInvoice & I,MyPayment & P)
// Copies info into a reconciliation record and returns late dollar days
{
long iAmount=I.amount;
//   long pAmount=P.amount;      // there is no need to track partially used payments
R.paymentNumber=P.number;
R.appliedAmount=amount;
R.invoiceNumber=I.number;
I.amount = iAmount - amount;
//   P.amount = pAmount - amount;// there is no need to track partially used payments
return amount*(P.day-I.day);
}

CombineInvoices
inline
MyInvoicePtr*
CombineInvoices(long balance,MyInvoice* I,
MyInvoice* mostRecentInvoice,MyInvoicePtr* stack)
// Searches invoices, from the range of invoices up to "mostRecentInvoice" to add up
// to "balance".
// The result is a sublist on the stack.
// Returns the top of the stack, or 0 if no match was found.
{
*stack=0;
MyInvoicePtr* SP=stack+1;
while (I && (I<=mostRecentInvoice))
{
if (balance < I->amount)      // invoice too large: try next in list
{
I=I->next;
if ((I>mostRecentInvoice) || (I==0))   // reached end of range
{
I=*-SP;                         // unwind stack
if (I==0) return 0;      // reached bottom: no multiple found
balance += I->amount;   // restore previous balance
I=I->next;                      // and try next in list instead
}
continue;
}

if (balance > I->amount)      // include this one ... perhaps
{
if (I<mostRecentInvoice)
// it's in range, and there is at least one other
{
*SP++=I;            // push this invoice on stack
balance -= I->amount;
I=I->next;
} else                  // go back to previously found and skip it
{
I=*-SP;                         // unwind stack
if (I==0) return 0;    // reached bottom: no multiple found
balance += I->amount;   // restore previous balance
I=I->next;                      // and try next in list instead
}
continue;
}

if (balance == I->amount)      // success
{
*SP++=I;                  // push this invoice on stack
return SP;               // and return stack

}
}
return 0;
}

PartialPayment
inline
MyInvoice* PartialPayment(long balance,MyInvoice* I,
MyInvoice* mostRecentInvoice)
// Returns the first invoice that exactly matches the balance,
//    failing an exact match, returns the invoice with the closest higher amount.
// Returns 0 if no exact or partial match is found.
{
MyInvoice* bestI=0;
long bestAmount=0x7FFFFFFF;
while (I && (I<=mostRecentInvoice)) {
if (I->amount == balance)
{
return I;
}

if (I->amount > balance)
{
if (I->amount < bestAmount)
{
bestI=I;
bestAmount=I->amount;
}
}
I=I->next;
}
return bestI;
}

ReconcilePayments
long ReconcilePayments (
const Invoice theInvoices[],
const Payment thePayments[],
Reconciliation theReconciliation[],
long numberOfReconciliationRecords,
long *lateDollarDays )
// Attempts to reconcile all invoices with the payments and computes the
//   lateDollarDays.
// Returns the number of ReconciliationRecords actually filled out.
{

// Prepare private copies of invoices
long numInvoices=Count(theInvoices);
MyInvoice* INV = new MyInvoice[numInvoices];

MyInvoice* I = INV;
const Invoice*   theI = theInvoices;
MyInvoice iList=MyInvoice(INV,0);
MyInvoice* mostRecentInvoice = &iList;

// Link all invoices into a list
for (int i=0;i<numInvoices;i++,theI++)
{
MyInvoice* nextInvoice=I+1;
*I=MyInvoice(*theI,nextInvoice,mostRecentInvoice);
mostRecentInvoice=I;
I=nextInvoice;
}
mostRecentInvoice->next=0;

// Prepare private copies of payments
long numPayments=Count(thePayments);
MyPayment* PAY = new MyPayment[numPayments];
MyPayment* P = PAY;
const Payment*   theP = thePayments;
MyPayment pList=MyPayment(PAY,0);
MyPayment* lastPayment = &pList;

// Link all payments into a list
for (int p=0;p<numPayments;p++,theP++)
{
MyPayment* nextPayment=P+1;
*P = MyPayment(*theP,nextPayment,lastPayment);
lastPayment=P;
P=nextPayment;
}
lastPayment->next=0;
long lastPayday=(-P)->day;

Reconciliation* R = theReconciliation;
// shorthand for a long variable name
long maxR = numberOfReconciliationRecords;
// shorthand for a long variable name

// Get memory for a stack for the non-recursive search
long stackSize=1 + numInvoices;
MyInvoicePtr*    iStack=new MyInvoicePtr[stackSize];

long numR=0;
long lateDD=0;

/* PHASE 1
Scan all payments, trying to match single or multiple invoices against them
*/
for (P=pList.next; P; P=P->next)
{
I=iList.next;
if (I==0) break;         // invoice list is empty: we're done
long amount=P->amount;
long theDay=P->day;

// scan forward through invoices to find a perfect match for a single invoice
MyInvoice* perfectMatch=0;
mostRecentInvoice=0;
while (I && (I->day <= theDay))
{
if (I->amount == amount)
{
perfectMatch=I;      // break on earliest match found
break;
}
mostRecentInvoice=I;
I=I->next;
}
P->mostRecentInvoice=mostRecentInvoice;
// side effect: gets invoice range for each payment

// use earliest perfect match if there is one
if (perfectMatch)
{
lateDD += Reconcile(amount,R[numR++],*perfectMatch,*P);
P->Remove();         // remove payment from list
perfectMatch->Remove();   // this invoice can be removed

if (numR >= maxR)      // all available recRecords used: must quit
goto phase3;
continue;
}

// try combining multiple invoices
MyInvoicePtr* SP=
CombineInvoices(amount,iList.next,mostRecentInvoice,iStack);
if (SP)
{
P->Remove();         // remove payment from the list
I=*-SP;                  // pop one invoice from the stack
do {
lateDD += Reconcile(I->amount,R[numR++],*I,*P);
I->Remove();      // this invoice can be removed
I=*-SP;               // pop next invoice from the stack
if (numR >= maxR)   // all available recRecords used: must quit
goto phase3;
} while (I);
}
}

/* PHASE 2
Scan remaining payments, trying to match them as partial payments against the remaining invoices
*/
for (P=pList.next; P; P=P->next)
{
I=iList.next;
if (I==0) break;         // no invoices left to balance: next phase
long amount=P->amount;
long theDay=P->day;

// find "best" partial payment
I=PartialPayment(amount,iList.next,P->mostRecentInvoice);
if (I)
{
P->Remove();
lateDD += Reconcile(amount,R[numR++],*I,*P);
if (I->amount==0)
I->Remove();
if (numR >= maxR)      // all available recRecords used: must quit
break;
}
}

/* PHASE 3
Scan remaining invoices, adding their unpaid balances to the late dollar days
*/
phase3:
for (I = iList.next; I; I=I->next)
lateDD+=(lastPayday-I->day)*I->amount;

// free dynamic memory
delete [] iStack;
delete [] PAY;
delete [] INV;

*lateDollarDays = lateDD;
return numR;
}

```

Community Search:
MacTech Search:

iShowU Instant 1.3.3 - Full-featured scr...
iShowU Instant gives you real-time screen recording like you've never seen before! It is the fastest, most feature-filled real-time screen capture tool from shinywhitebox yet. All of the features you... Read more
Affinity Photo 1.8.3 - Digital editing f...
Affinity Photo - redefines the boundaries for professional photo editing software for the Mac. With a meticulous focus on workflow it offers sophisticated tools for enhancing, editing and retouching... Read more
Affinity Designer 1.8.3 - Vector graphic...
Affinity Designer is an incredibly accurate vector illustrator that feels fast and at home in the hands of creative professionals. It intuitively combines rock solid and crisp vector art with... Read more
Pinegrow 5.95 - Mockup and design web pa...
Pinegrow (was Pinegrow Web Designer) is desktop app that lets you mockup and design webpages faster with multi-page editing, CSS and LESS styling, and smart components for Bootstrap, Foundation,... Read more
WhatRoute 2.3.1 - Geographically trace o...
WhatRoute is designed to find the names of all the routers an IP packet passes through on its way from your Mac to a destination host. It also measures the round-trip time from your Mac to the router... Read more
Dropbox 94.4.384 - Cloud backup and sync...
Dropbox for Mac is a file hosting service that provides cloud storage, file synchronization, personal cloud, and client software. It is a modern workspace that allows you to get to all of your files... Read more
Boom 3D 1.3.6 - \$19.99
Boom 3D is a revolutionary app with 3D Surround Sound and phenomenally rich and intense audio that is realistic and works on any headphones. Features 3D surround sound Built-in audio player... Read more
Remotix 6.1.4 - Access all your computer...
Remotix is a fast and powerful application to easily access multiple Macs (and PCs) from your own Mac. Features: Complete Apple Screen Sharing support - including Mac OS X login, clipboard... Read more
iMazing 2.11.4 - Complete iOS device man...
iMazing (was DiskAid) is the ultimate iOS device manager with capabilities far beyond what iTunes offers. With iMazing and your iOS device (iPhone, iPad, or iPod), you can: Copy music to and from... Read more
EtreCheck Pro 6.2.4 - For troubleshootin...
EtreCheck is an app that displays the important details of your system configuration and allow you to copy that information to the Clipboard. It is meant to be used with Apple Support Communities to... Read more

Latest Forum Discussions

Hearthstone's new Demon Class is no...
A couple of weeks ago Blizzard announced that the game would be introducing its first new class since the game first launched in 2014. It's called the Demon Hunter and as of today, players will be able to get a glimpse and feel for how it will... | Read more »
The 5 Best Games Like Dark Souls
There's no escaping the fact that everyone loves Dark Souls. If you've not heard of it, it's a super tough action RPG that punished your every mistake with swift retribution. It's the sort of game where you die a lot, and it can be pretty... | Read more »
The Curse of Issyos is a retro-inspired...
The Curse of Issyos is the latest game to be ported to mobile and published by Abylight S.L who previously worked on Cursed Castilla. Much like that port, this game was also originally created by Spanish developers Locomalito. The Curse of Issyos... | Read more »
Same Room Games is a great collection of...
Staying at home under lockdown kinda sucks. Totally necessary, yes, but also more than a little anxiety-inducing and often boring. Thankfully, we've got lots of great multiplayer games to play with friends and keep us sane, the latest of which,... | Read more »
Bark Park is a joyfully silly multiplaye...
Bark Park is a charming, good-humoured game about competing against other players to claim as much territory as possible by peeing on nearby trees. Did I mention that everyone is playing as a dog? Makes things a little less weird. [Read more] | Read more »
The 5 Best Games Like Grindstone
Apple Arcade made a splash when it first launched, granting access to over 50 games as soon as it became available. Of those titles, the one that seemed to grab most people’s attention was Grindstone, a matching puzzle game from Capy Games. [Read... | Read more »
Awarding-winning puzzler Make One is now...
Make One is a game with a simple concept that it executes with flair and impressive levels of polish. It comes to us from developer Brazle and publisher PiG, and it's just landed this week for Android. At its core, Make One is a logic-based... | Read more »
Marvel Contest of Champions' latest...
Kabam's Marvel Contest of Champions has now teased some of the latest characters heading to the Battlerealm next month. Here's your chance to watch the new motion comic embedded below, Barons' War, before I spoil the surprise. [Read more] | Read more »
Why Calibria: Crystal Guardians is the p...
We could all use escapism right now, something to focus on and a project to feel part of during these times of social isolation. If you’re one of the many who’s turned to gaming to fill the lockdown void, Calibria: Crystal Guardians should be on... | Read more »
Mini Tank: Fire is a Worms-like, turn-ba...
Mini Tank: Fire is an online multiplayer game that takes a few cues from the likes of Worms and Shell Shock Live. It will feature 5v5 turn-based battles and is available now for both iOS and Android as a free-to-play game. [Read more] | Read more »

Price Scanner via MacPrices.net

Clearance 13″ 128GB MacBook Air in stock toda...
Guitar Center has clearance 2019 13″ 1.6GHz/128GB Space Gray MacBook Airs in stock today for \$899 shipped. That’s \$200 off Apple’s original MSRP for this model and the cheapest price available today... Read more
Weekend sale: 21″ & 27″ iMacs for up to \$...
B&H Photo has new 21″ and 27″ 5K iMacs in stock today and on sale for up to \$200 off Apple’s MSRP. These are the same iMacs sold by Apple in their retail and online stores, and B&H’s prices... Read more
Here’s how you can save \$50 today on one of A...
– 11″ 128GB WiFi iPad Pro: \$789 \$10 off – 11″ 256GB WiFi iPad Pro: \$849 \$50 off – 11″ 512GB WiFi iPad Pro: \$1049 \$50 off – 11″ 1TB WiFi iPad Pro: \$1249.99 \$50 off – 11″ 128GB WiFi + Cell iPad Pro: \$... Read more
Apple AirPods Pro back on sale at Amazon for...
Amazon has Apple’s AirPods Pro in stock and on sale today for \$234.98 shipped. Their price is about \$15 (6%) off Apple’s MSRP and the cheapest price available for these new models from any Apple... Read more
Apple restocks clearance, previous-generation...
Apple has clearance, Certified Refurbished, 2019 13″ MacBook Airs available for only \$779. Each MacBook features a new outer case, comes with a standard Apple one-year warranty, and is shipped free.... Read more
Retro Reading: PowerBook Central Coverage of...
FEATURE: 04.03.20- Welcome to another edition of “Retro Reading,” a series here in my column, “Mac Potpourri,” where we dig deep into the archives for content written on today’s date several years... Read more
Price drop! 21″ 3.6GHz Quad-Core 4K iMac on s...
B&H Photo has the 21″ 3.6GHz Quad-Core 4K iMac in stock today and on sale for \$1099.99 including free next day shipping to many locations in the US. That’s \$200 off Apple’s MSRP: – 21″ 3.6GHz... Read more
Amazon is again offering \$129 Apple AirPods,...
Amazon has Apple AirPods with Charging Case on sale again for \$129.98 shipped. Their price is \$30 off Apple’s MSRP for these AirPods. Their price is the cheapest available for AirPods from any Apple... Read more
Apple continues to offer iMac discounts rangi...
Apple has Certified Refurbished 2019 21″ & 27″ iMacs available starting at \$929 and up to \$350 off the cost of new models. Apple’s one-year warranty is standard, shipping is free, and each iMac... Read more
Apple offers Certified Refurbished iPhone XS...
Apple has Certified Refurbished iPhone XS models available for up to \$350 off MSRP, with prices starting at \$699. Each iPhone is unlocked and comes with Apple’s standard one-year warranty and a new... Read more

Jobs Board

Tier II Support Specialist- *Apple* - KeenL...
…will be responsible for Desktop Support of an environment composed of Apple workstations and several custom business applications. Job Responsibilities: + Providing Read more
Sephora Merchandise/Operations Supervisor -...
Sephora Merchandise/Operations Supervisor - Apple Blossom Mall Location:Winchester, VA, United States- Apple Blossom Mall 1850 Apple Blossom Dr Job Read more
Sales Supervisor - *Apple* Blossom Mall - J...
Sales Supervisor - Apple Blossom Mall Location:Winchester, VA, United States- Apple Blossom Mall 1850 Apple Blossom Dr Job ID:1083621Store Hourly Positions Read more
*Apple* Mac Product Engineer - Barclays (Uni...
Apple Mac Engineer Whippany, NJ Support the development and delivery of solutions, products, and capabilities into the Barclays environment working across technical Read more
Essbase Developer - *Apple* - Theorem, LLC...
Job Summary Apple is seeking an experienced, detail-minded Essbase developer to join our worldwide business development and strategy team. If you are someone who Read more