TweetFollow Us on Twitter

Random Walk Generator

Volume Number: 15 (1999)
Issue Number: 11
Column Tag: Programming Techniques

A Random Walk Generator

by F.C. Kuechmann, Vancouver, WA

A CodeWarrior Pascal implementation of the "random walk" decision simulation technique

Introduction

Humans have seemingly always been fascinated by random phenomena. Randomness is a pervasive component of our everyday lives. It characterizes the patterns of raindrops, shape and location of clouds, traffic on the freeway. It describes the selection of winning numbers in the lottery and day-to-day changes in the weather. The science of chaos says that everything began in pure randomness and will end that way.

The computer provides a means for the systematic extended study of randomness and pseudo-randomness that is impractical using simpler methods such as flipping coins or rolling dice. A graphics-oriented computer and a simple algorithm such as a two-dimensional random walk is ideal for the visual display and exploration of random principles.

The random walk decision procedure, like the eight queens and knight's tour problems, predates computers. In one college finite math textbook (Kemeny et. al. , 1962) it is described in the context of an absorbing (i.e. terminating) Markov chain process wherein, at each decision point, only the most recent decision is considered when making the current one. Variations of the random walk method are currently used with computers to simulate systems in the fields of physics, biology, chemistry, statistics, marketing, population dynamics, and others. A bit of Internet prowling will unearth information on many current applications. An Alta Vista search on the key "random walk" generated 2988 hits, many of them redundant, but containing at least one hit for most of the current applications of the method. Sourcecode for various implementations is freely available on the net in languages ranging from Java to C to Lisp.


Figure 1.A random walk.

The Random Walk Algorithm

In one of its simplest forms, a random walk is an absorbing Markov chain process with three possible outcomes at each step. Each new step can be perpendicular to the previous step (two of the possible outcomes) unless the absorbing state has been reached (the third possible outcome) and no further moves are possible. Absent the absorbing condition, if the previous step moved up or down, the current step must go left or right. If the previous step moved left or right, the current one must move up or down. A somewhat more complex variant adds a fourth possible outcom - continue in the same direction as the previous step. If we go further and allow each step to be in any direction regardless of the previous step, the process generates somewhat more interesting graphic patterns.

An absorbing state is one in which no further steps are possible. For simulation purposes in a college math class we might begin with a jolly drunk at his favorite tavern departing for home. If and when he reaches home, jolly has achieved an absorbing state. Additional absorbing states might be added in the form of policemen, and the tavern itself might be an additional absorbing state - if jolly returns for additional liquid nourishment.


Figure 2.Another random walk.

The Program

Conceptually, implementing a basic random walk is relatively simple. If we assume that each step can be in any of four directions (North-South-East-West, or up-down-left-right) regardless of the direction of the previous step, and that the number of steps is infinite, we can describe the walk in pseudocode as follows

choose starting point
repeat
choose random direction 1-4
step in chosen direction
until forever

If we limit the permissible direction to one perpendicular to the previous direction, for example, things get a bit more complicated because we need to keep track of the direction of each step. One obvious method is with Boolean flag variables. The pseudocode then might look like this

choose starting point
repeat
repeat
	choose random direction 1-4
	test flags for ok
until direction ok
set and clear flags to track direction
step in chosen direction
until forever

An interactive Mac program gets still more complex. There's little reason to impose undue limits on the possible variations and variables in the walk. We easily can provide for variable fixed or random step lengths, widths, colors and number of steps per walk, as well as variable execution speed. I've allowed for as many variations and possibilities as seem to produce graphically interesting results.

Creating steps

The main part of the program is shown in Listing 1 . After initializing the toolbox, window, menus, global variables, etc, the program executes a loop that repeatedly calls procedures that create new steps, check for events, etc., until the Boolean exit variable ggDoneFlag is TRUE.

Listing 1.

RandomWalk
	{Macintosh random walk program in CodeWarrior Pascal}

Program RandomWalk;
uses	
	Globals,Inits,Misc,StepStuff,GetReady;

{ Main RandomWalk }
begin	  
	Initialize;
	GetPen(ggThePoint);
	Repeat
		NewStep;
		CheckEvents;
		if ggDoneFlag then
			Leave;
		
			{get ready for another round if not quiting}
			{and max step count}
		if ggStepCount >= ggMaxSteps then
			GetReadyForMore

			{wait for 'go' button press if single-stepping}	
		else if ggStepWaitFlag then
			begin
				ggGoFlag := FALSE;
				SetControlTitle(ggGoButtonHdl, 'Go');
				CheckEvents;
			end
		else
			Stall(ggStallVal);
	Until ggDoneFlag;
	
end.	

The main loop calls the NewStep procedure in Listing 2 for each new step. It first gets a new random 1-10 pixel step width in the variable ggStepWid if the Boolean variable ggRandomWidFlag is TRUE; otherwise the step width value remains that selected via menu. The step width is then saved in the local variable stepWid so that it can be restored if it is reduced later due to proximity to the right or bottom edge of the window. Random step length 1-15 pixels and random color are selected next, if the governing Boolean flags are TRUE. The details of random color selection are discussed later in this article.

NewStep retrieves the saved pen position and calls the procedure GetDirection (Listing 3 ) to select a legal step direction, followed by a call to SetPenAndDeltas (Listing 7 ) to set pen width and height dimensions and the values of variables dX and dY . The pen position must be saved after each step and restored before each new step because clicking the mouse button sets the pen position. If the mouse click is inside the active walking window that point becomes the new pen position; otherwise we test to see if a button on the control panel at right. See the EventStuff source code for details.

For horizontal steps, the horizontal parameter for the toolbox PenSize call is 1, the vertical parameter is that held in the global variable ggStepWid . For vertical steps, the horizontal parameter equals ggStepWid , the vertical 1. The end position co-ordinates after the newly-calculated step are obtained by adding X to dX and Y to dY . We then check to see if the new position is outside the window. If it is, one of the four wrap procedures is called. These procedures draw the step to the edge of the window, then wrap around to the opposite edge of the window if the variable ggWrapFlag is TRUE. If the new endpoint is not outside the window (which is most of the time) the step is drawn in the NewStep procedure by calling the toolbox Line procedure. After a bit of tidying up, the pen location is saved in the global Point variable ggThePoint before exiting.

Listing 2.

NewStep

{ trace a step in the window,}
{ possibly random length, width and color. }

	procedure NewStep;
	var
		dX, dY : integer;
		X, Y, newX, newY, dir, stepWid : longint;
	begin
		Inc(ggStepCount);
		UpdateStepCount;

			{get new step width if random mode}
		if ggRandomWidFlag then
			begin
				SetRandWid;
				UpdateStepWidth;
			end;

			{save step width}
		stepWid := ggStepWid;

			{get new step size if random mode}
		if ggRandSizeFlag then
			begin
				SetRandLen;
				UpdateStepLen;
			end;

			{get random step color if random mode}
		if ggRandomColorFlag then
			SetRandColor
		else
			SetStepColor;

			{save step color}
		ggStepColors[ggStepCount] := ggFieldColor;

			{fetch pen position}
		with ggThePoint do
			begin
				X := h;
				Y := v;
			end;

			{get random step direction}
		GetDirection(dir, X, Y);
			
		SetPenAndDeltas(dir, dX, dY);
		MoveTo(X, Y);

			{new XY pen co-ordinates after next step}
		newX := X + dX;
		newY := Y + dY;

			{check for wrap-arounds}
		if newY < ggMinY then
			begin
				DoTopWrap(Y, X, dX);
				ggWrapDir[ggStepCount] := 1;
			end
		else if newX > (ggMaxX) then
			begin
				DoRightWrap(Y, X, dY);
				ggWrapDir[ggStepCount] := 2;
			end
		else if newY > ggMaxY then
			begin
				DoBottomWrap(Y, X, dX);
				ggWrapDir[ggStepCount] := 3;
			end
		else if newX < ggMinX then
			begin
				DoLeftWrap(Y, X, dY);						
				ggWrapDir[ggStepCount] := 4;
			end		
		else
				{no boundary problem; draw step here}
			Line(dX, dY);

		if not ggWrapFlag then
			ggWrapDir[ggStepCount] := 0;
			
		GetPen(ggThePoint);
		with ggThePoint do
			begin
				X := h;
				Y := v;
			end;
			
		MoveTo(X, Y);
		GetPen(ggThePoint);

			{save pen position for field redraw}
		ggStepPositions[ggStepCount] := ggThePoint;
		ggStepWid := stepWid;
	end;
end.

Selecting direction

There are three button-selectable modes to limit the permissible directions for each new step. A direction is first selected by generating a random integer in the range 1-4. The selected direction is then tested according to the current mode. The work is done in a repeat loop inside the GetDirection procedure shown in Listing 3 .

Listing 3.

GetDirection
		{select random direction 1-4, then call move}
		{procedures to test legality and distance from}
		{right or bottom edge}

	procedure GetDirection(var dir, X, Y : longint);
	var
		count : integer;
		randFlag : boolean;
	begin
		count := 0;
		randFlag := FALSE;
		repeat
			Inc(count);
			dir := (abs(Random) mod 4) + 1;
				{ test for parallel moves less than 1 stepwidth from }
				{	the right or bottom edges. }
			case ggWayCount of
				ggcPerp:
					MovePerp(dir, X, Y, randFlag);	
				ggcPerpOrFwd:
					MovePerpOrFwd(dir, X, Y, randFlag);		
				ggcAnyWay:
					MoveAnyWay(dir, X, Y, randFlag);
			end;
		until randFlag or (count > 1000);
	end;

The integer variable count was used as a safety valve during debugging and could probably be safely deleted. The value of the global integer variable ggWayCount determines which step directions are legal. One of three procedures is selected by the case statement with ggWayCount as the selection index. These procedures, shown in Listing 4a, Listing 4b and Listing 4c use global Boolean flags set by the previous step to determine whether the selected direction is permitted in the current mode. If the step direction is permitted, the called procedure sets the exit variable randFlag to TRUE, sets the global direction flags (either locally or by calling the SetFlags procedure in Listing 5 ) to indicate the new step direction, and then calls the procedures in Listing 6 .

Listing 4a.

MovePerp
		{step perpendicular to previous step}

	procedure MovePerp(dir : longint; var X, Y : longint;
															var randFlag : boolean);
	begin
		case dir of
			ggcUp, ggcDn:
				begin
					if not ggUpDnFlag then
						begin
							ggUpDnFlag := TRUE; 
							ggRtLftFlag := FALSE;
							randFlag := TRUE;
							CheckRight(X);
						end;
				end;
		 	ggcRt, ggcLft:
		 		begin
			 		if not ggRtLftFlag then
						begin
							ggUpDnFlag := FALSE; 
							ggRtLftFlag := TRUE;
							randFlag := TRUE;
							CheckBottom(Y);
						end;
				end;
		end;
	end;

The default "2-way" mode allows only steps perpendicular to the previous step. The "3-way" mode allows perpendicular and forward steps, and "4-way" mode permits steps in any direction.

Listing 4b.

MovePerpOrFwd
		{move any direction but backward}

	procedure MovePerpOrFwd(dir : longint; var X, Y : longint;
																 var randFlag : boolean);
		{move any direction but opposite the previous step}
	begin	
		ggUpDnFlag := FALSE; 
		ggRtLftFlag := TRUE;
			{if previous step was up and current step not down}
		if ggUpFlag and (dir <> ggcDn) then
			begin
				SetFlags(dir);
				randFlag := TRUE;
				case dir of
					ggcRt, ggcLft:
						CheckBottom(Y);
					ggcUp:
						CheckRight(X);
				end;
			end
				{if previous step was down and current step not up}
		else if ggDnFlag and (dir <> ggcUp) then
			begin
				SetFlags(dir);
				randFlag := TRUE;
				case dir of
					ggcRt, ggcLft:
						CheckBottom(Y);
					ggcDn:
						CheckRight(X);
				end;
			end
				{previous step to right}
		else if ggRtFlag and (dir <> ggcLft) then
			begin
				SetFlags(dir);
				randFlag := TRUE;
				case dir of
					ggcRt:
						CheckBottom(Y);
					ggcUp, ggcDn:
						CheckRight(X);
				end;
			end	
				{previous step to left}
		else if ggLftFlag and (dir <> ggcRt) then
			begin
				randFlag := TRUE;
				SetFlags(dir);
				case dir of
					ggcLft:
						CheckBottom(Y);
					ggcUp, ggcDn:
						CheckRight(X);
				end;
			end;
	end;

Listing 4c.

MoveAnyWay
		{step in any direction}

	procedure MoveAnyWay(dir : longint; var X, Y : longint;
																var randFlag : boolean);
	begin
		case dir of
			ggcUp, ggcDn:
				CheckRight(X);
			ggcRt, ggcLft:
				CheckBottom(Y);		
		end;
		randFlag := TRUE;
	end;

Listing 5.

SetFlags
		{sets global flags for step direction}

	procedure SetFlags(dir : longint);
	begin
		case dir of
			ggcUp :
				begin
					ggUpFlag := TRUE;
					ggDnFlag := FALSE;
					ggRtFlag := FALSE;
					ggLftFlag := FALSE;
				end;
			ggcRt :
				begin
					ggUpFlag := FALSE;
					ggDnFlag := FALSE;
					ggRtFlag := TRUE;
					ggLftFlag := FALSE;
				end;
			ggcDn :
				begin
					ggUpFlag := FALSE;
					ggDnFlag := TRUE;
					ggRtFlag := FALSE;
					ggLftFlag := FALSE;
				end;
			ggcLft :
				begin
					ggUpFlag := FALSE;
					ggDnFlag := FALSE;
					ggRtFlag := FALSE;
					ggLftFlag := TRUE;
				end;
		end;
	end;

Boundary disputes

The Mac tends to draw an unwanted diagonal line when asked to draw a line parallel to the right or bottom window edge if the line width plus the pen co-ordinate exceeds the maximum permitted - one less than the window border. For example, if the window width is 300, the current X co-ordinate is 295, the horizontal PenSize is 6, and we want to draw a vertical line, we do not get a nice, straight line (and, if we next wrap to the left edge of the window by stepping right, the first line there will be a diagonal). The way I have chosen to handle the problem is to reduce the line width until it no longer exceeds the maximum, or until it reaches the minimum value of 1. In the rare instance that the line width is at the minimum and the sum of the X co-ordinate and width exceeds the permissible maximum, I reduce the X co-ordinate. The window height and Y co-ordinate are handled in a similar manner. The code in Listing 6 , called by the code inListing 4 , performs the edge tests and makes any necessary adjustments.

Listing 6a.

CheckBottom
		{checks distance between the Y co-ordinate}
		{and bottom of the window; if less than the}
		{step width, the step width is reduced; if}
		{distance is still too small when step width}
		{is 1, the Y co-ordinate is decremented}
	
	procedure CheckBottom(var Y : longint);
	var
		dif : integer;
	begin
			{step parallel bottom edge, check distance}
			{if too close, make step narrower or move pen}
		if (Y + ggStepWid) > ggMaxY then
			begin
				dif := (Y + ggStepWid) - ggMaxY;
				if dif = 0 then
					begin
						if ggStepWid > 1 then
							ggStepWid := ggStepWid - 1
						else
							Y := Y - 1;
					end
				else
					ggStepWid := ggStepWid - dif;
			end;
	end;

Listing 6b.

CheckRight
		{checks distance between the X co-ordinate}
		{and right edge of the window; if less than the}
		{step width, the step width is reduced; if}
		{distance is still too small when step width}
		{is 1, the X co-ordinate is decremented}

	procedure CheckRight(var X : longint);
	var
		dif : integer;
	begin
			{move is parallel right edge, so check distance}
			{if too close, make step narrower if wider than}
			{one pixel else move pen left}
		if (X + ggStepWid) > ggMaxX then
			begin
				dif := (X + ggStepWid) - ggMaxX;
				if dif = 0 then
					begin
						if ggStepWid > 1 then
							ggStepWid := ggStepWid - 1
						else
							X := X - 1;
					end
				else
					ggStepWid := ggStepWid - dif;
			end;
	end;

Listing 7.

	SetPenAndDeltas
		{using the direction code held in dir, sets pen}
		{height and width, saves in global arrays for}
		{update, sets vars dX and dY to the distance of}
		{the step}

	procedure SetPenAndDeltas(dir : longint; 
												var dX, dY : integer);
	begin		
		case dir of
			ggcUp :
				begin
					PenSize(ggStepWid, 1);
					ggStepWidthHor[ggStepCount] := ggStepWid;
					ggStepWidthVert[ggStepCount] := 1;
					dY := -ggStepSize;
					dX := 0;
				end;
			ggcRt :
				begin
					PenSize(1, ggStepWid);
					ggStepWidthHor[ggStepCount] := 1;
					ggStepWidthVert[ggStepCount] := ggStepWid;
					dX := ggStepSize;
					dY := 0;
				end;
			ggcDn :
				begin
					PenSize(ggStepWid, 1);
					ggStepWidthHor[ggStepCount] := ggStepWid;
					ggStepWidthVert[ggStepCount] := 1;
					dY := ggStepSize;
					dX := 0;
				end;
			ggcLft :
				begin
					PenSize(1, ggStepWid);
					ggStepWidthHor[ggStepCount] := 1;
					ggStepWidthVert[ggStepCount] := ggStepWid;
					dX := -ggStepSize;
					dY := 0;
				end;
		end;
	end;

Random colors

Generating random colors that contrast sufficiently with a black background can be a problem. The standard RGB blue, especially, fails to stand out. The following selection method, devised through experimentation, seems to work well.

If the RGB value of either red or green (or both) is negative, contrast is sufficient. Otherwise, ths sum of the values of red, green and blue should exceed 45000. The toolbox Random function returns a signed integer value in the range -32767..32767. In the toolbox, RGBForeColor treats the variables passed to it as red, green and blue values in the color record as unsigned 16-bit integers in the range 0..65535. A "negative" value returned by the Random function is thus treated by RGBForeColor as a value in the range 32768..65535. In Pascal, the requirents can be satisfied by the code in Listing 8 .

Listing 8.

SetRandomColor
		{sets a random color for each step, avoiding
		 insufficient contrast with the background}
	procedure SetRandomColor;
	var
		t: longint;
	begin
		with ggFieldColor do
			begin
				repeat
					red := Random;  
					green := Random; 
					blue := Random;
					if (red < 0) or (green < 0) then
						Leave;
					t := red + green + blue; 	
				until t > 45000;
			end;
			
		RGBForeColor(ggFieldColor);
	end;

To bound or not to bound

One of the more obvious of the decisions that need to be made in creating a graphical random walk program is what to do when a walk threatens to stray beyond the display window borders, as when the step size plus the current co-ordinate exceeds the size of the window in any direction. Three of the more obvious solutions are

  1. Scroll the window
  2. Limit movement to the window
  3. Wrap around to the opposite edge

I chose to allow switching between the second and third options, limiting steps at the edges or wrapping steps to the opposite edge.

The test to determine whether a step exceeds the window borders is performed in the NewStep procedure shown in Listing 1 . If a boundary is exceeded, one of the procedures in Listing 9 from the StepWraps unit is called to draw the step and, if necessary, perform the wrap around.

Listing 9a.

DoRightWrap
{end of new step exceeds the right border, so wrap}
{around to the left edge of the window}

	procedure DoRightWrap(Y, X, dY : integer);
	var
		rX, dif : integer;
	begin
		rX := ggMaxX - X;
		if rX < 2 then
			begin
				MoveTo(ggMaxX - 2, Y);
				rX := 2;
			end;
		Line(rX, dY);
		if ggWrapFlag then
			begin
				MoveTo(ggMinX, Y);
				dif := ggStepSize - rX;
				if dif < 1 then
					dif := 1;
				Line(dif, dY);
			end
		else
			MoveTo(ggMaxX - ggStepWid, Y);
	end;

Listing 9b.

DoBottomWrap
{end of new step exceeds the bottom border, so wrap}
{around to the top edge of the window}
			
	procedure DoBottomWrap(Y, X, dX : integer);
	var
		rY, dif : integer;
	begin	
		rY := ggMaxY - Y;
		Line(dX, rY);
		if ggWrapFlag then
			begin
				MoveTo(X, ggMinY);
				dif := ggStepSize - rY;
				Line(dX, dif);
			end
		else
			MoveTo(X, ggMaxY - ggStepWid);
	end;

Listing 9c.

DoLeftWrap
{end of new step exceeds the left border, so wrap}
{around to the right edge of the window}

	procedure DoLeftWrap(Y, X, dY : integer);
	var
		rX, dif : integer;
	begin
		rX := X - ggMinX;
		if rX < 2 then
			begin
				MoveTo(2, Y);
				rX := 2;
			end;
		Line(-rX, dY);
		if ggWrapFlag then
			begin
				MoveTo(ggMaxX, Y);
				dif := abs(ggStepSize - rX);
				Line(-dif, dY);
			end;
	end;

Listing 9d.

DoTopWrap
{end of new step exceeds the top border, so wrap}
{around to the bottom edge of the window}

	procedure DoTopWrap(Y, X, dX : integer);
	var
		rY, dif : integer;
	begin
		rY := Y - ggMinY;
		Line(dX, -rY);
		if ggWrapFlag then
			begin
				MoveTo(X, ggMaxY);
				dif := abs(ggStepSize - rY);
				Line(dX, -dif);
			end;
	end;

Some sourcecode conventions

Sourcecode and CodeWarrior Pro, release 2, Pascal projects for both PowerPC and 68k are provided. The use of descriptive names for constants, variables, functions and procedures makes the CodeWarrior Pascal sourcecode largely self-documenting. Constants and variables that are global to the entire program begin with the letters "ggc" (constants) or "gg" (variables), followed by at least one uppercase alpha or numeric character. They are defined in the Globals unit. Constants and variables global to a single unit begin with "gc" or "g", followed by at least one uppercase alpha or numeric character. The MenuStuff unit holds menu routines, EventStuff the event handlers, etc.

Both PPC and 68k aps are also available for download.

Running the Program

The Buttons

To the left in the Random Land window is the black display field, and on the right is the blue control panel. The control panel displays the number of steps, step size, and step width, and has buttons initially labelled NoWrap, Colors, Clear, 3-Way, Go and Quit.

In its default mode RandomWalks wraps to the opposite window edge when a step exceeds the window boundary. Clicking the NoWrap button sets the mode to prevent wrapping and relabels the button Wrap. Each button click toggles between the two modes.

The Colors control button toggles color selection mode between the default mode in which each of the three RGB values is independently randomly determined using the code in Listing 7 and six fixed saturated colors. The default mode gives a seemingly limitless number of colors.

The Clear button clears the field, resets the step counter to zero, and starts the cycle anew.

The default directions mode is "2-way", which restricts each new step to a direction perpendicular to that of the previous step. The button labelled 3-Way, when clicked, sets the step direction mode to allow steps both perpendicular to and in the same direction as the previous step and the button is then re-labelled 4-Way. The 4-Way button, when clicked, sets the direction mode to allow steps in any of the four possible directions and the button is re-labelled 2-Way. Clicking the button again returns to the default "2-way" mode.

The Go button initiates stepping and is re-labelled Pause when clicked.

The Quit button's function should be a tad obvious and is duplicated by selecting Quit from the File menu or typing Command-Q.

The Menus

The menu bar offers the standard Apple, File and Edit menus on the left, followed by menus to select execution Speed, number of Steps, StepSize, StepWidth, step Color and Delay between cycles. Default values are medium speed, 400 steps, five pixel step size, one pixel step width, random colors and five second delay.

The Walk

To begin random walking, click the Go button. The default origin point for stepping is the middle of the black rectangle, but it can be set to another location by clicking there with the mouse.

Enhancements

The program currently makes "pretty pictures" and would not be suitable to use, for instance, to illustrate the movement in two dimensions of gas molecules in a vacuum for an introductory physics class. It could be modified to provide a simplified demonstration of the general principles involved, however. We might begin with a 1-pixel by 1-pixel step size and initialize 1000 molecules by randomly generating co-ordinates while tracking occupied positions with a 2-D Boolean array. Memory use could be greatly reduced at the expense of some arithmetic by using the individual bits in an array of unsigned integers to track occupancy. Movements are generated by indexing through each position in the 300 by 450 grid. If a position is occupied by a molecule we generate a direction in which to move, otherwise the position is ignored. Each move direction is tested to see if the position in that direction is occupied. If it isn't, erase the current molecule and redraw it in the new location; otherwise we have a collision and both molecules rebound one step. We must also test for the window boundaries. We can update the display as each change is made, or we can make changes initially in the tracking arrays only, then update all at once when the entire field has been scanned.

References

  • Kemeny, Schleifer, Snell, and Thompson, Finite Mathematics , Prentice-Hall 1962.

F.C. Kuechmann <fk@aone.com> is a programmer, hardware designer and consultant with degrees from the University of Illinois at Chicago and Clark College. He is building a programmers' clock that gives the time in hexadecimal.

 

Community Search:
MacTech Search:

Software Updates via MacUpdate

1Password 6.6.4 - Powerful password mana...
1Password is a password manager that uniquely brings you both security and convenience. It is the only program that provides anti-phishing protection and goes beyond password management by adding Web... Read more
Cocktail 10.3.1 - General maintenance an...
Cocktail is a general purpose utility for macOS that lets you clean, repair and optimize your Mac. It is a powerful digital toolset that helps hundreds of thousands of Mac users around the world get... Read more
Safari Technology Preview 10.2 - The new...
Safari Technology Preview contains the most recent additions and improvements to WebKit and the latest advances in Safari web technologies. And once installed, you will receive notifications of... Read more
Together 3.8 - Store and organize all of...
Together helps you organize your Mac, giving you the ability to store, edit and preview your files in a single clean, uncluttered interface. Features Smart storage. With simple drag-and-drop... Read more
GraphicConverter 10.4 - $39.95
GraphicConverter is an all-purpose image-editing program that can import 200 different graphic-based formats, edit the image, and export it to any of 80 available file formats. The high-end editing... Read more
beaTunes 4.6.13 - Organize your music co...
beaTunes is a full-featured music player and organizational tool for music collections. How well organized is your music library? Are your artists always spelled the same way? Any R.E.M. vs REM?... Read more
Vienna 3.1.9 :e81515b: - RSS and Atom ne...
Vienna is a freeware and Open-Source RSS/Atom newsreader with article storage and management via a SQLite database, written in Objective-C and Cocoa, for the OS X operating system. It provides... Read more
iExplorer 4.0.12.0 - View and transfer f...
iExplorer is an iPhone browser for Mac lets you view the files on your iOS device. By using a drag and drop interface, you can quickly copy files and folders between your Mac and your iPhone or... Read more
OpenEmu 2.0.5 - Open Source game-emulati...
OpenEmu is about to change the world of video game emulation, one console at a time... For the first time, the 'It just works' philosophy now extends to open source video game emulation on the Mac.... Read more
TextSoap 8.3.3 - Automate tedious text d...
TextSoap can automatically remove unwanted characters, fix up messed up carriage returns, and do pretty much anything else that we can think of to text. Save time and effort. Be more productive. Stop... Read more

Ticket to Earth beginner's guide: H...
Robot Circus launched Ticket to Earth as part of the App Store's indie games event last week. If you're not quite digging the space operatics Mass Effect: Andromeda is serving up, you'll be pleased to know that there's a surprising alternative on... | Read more »
Leap to victory in Nexx Studios new plat...
You’re always a hop, skip, and a jump away from a fiery death in Temple Jump, a new platformer-cum-endless runner from Nexx Studio. It’s out now on both iOS and Android if you’re an adventurer seeking treasure in a crumbling, pixel-laden temple. | Read more »
Failbetter Games details changes coming...
Sunless Sea, Failbetter Games' dark and gloomy sea explorer, sets sail for the iPad tomorrow. Ahead of the game's launch, Failbetter took to Twitter to discuss what will be different in the mobile version of the game. Many of the changes make... | Read more »
Splish, splash! The Pokémon GO Water Fes...
Niantic is back with a new festival for dedicated Pokémon GO collectors. The Water Festival officially kicks off today at 1 P.M. PDT and runs through March 29. Magikarp, Squirtle, Totodile, and their assorted evolved forms will be appearing at... | Read more »
Death Road to Canada (Games)
Death Road to Canada 1.0 Device: iOS Universal Category: Games Price: $7.99, Version: 1.0 (iTunes) Description: Get it now at the low launch price! Price will go up a dollar every major update. Update news at the bottom of this... | Read more »
Bean's Quest Beginner's Guide:...
Bean's Quest is a new take on both the classic platformer and the endless runner, and it's free on the App Store for the time being. Instead of running constantly, you can't stop jumping. That adds a surprising new level of challenge to the game... | Read more »
How to rake in the cash in Bit City
Our last Bit City guide covered the basics. Now it's time to get into some of the more advanced techniques. In the later cities, cash flow becomes much more difficult, so you'll want to develop some strategies if you want to complete each level.... | Read more »
PixelTerra (Games)
PixelTerra 1.1.1 Device: iOS Universal Category: Games Price: $.99, Version: 1.1.1 (iTunes) Description: The world of PixelTerra is quite dangerous so you need to build a shelter, find some food supply and get ready to protect... | Read more »
Tokaido™ (Games)
Tokaido™ 1.0 Device: iOS Universal Category: Games Price: $6.99, Version: 1.0 (iTunes) Description: Discover the digital adaptation of Tokaido, the boardgame phenomenon that has already sold more than 250,000 copies worldwide, and... | Read more »
Card Thief (Games)
Card Thief 1.0 Device: iOS Universal Category: Games Price: $1.99, Version: 1.0 (iTunes) Description: Card Thief is a solitaire style stealth game played with a deck of cards. In Card Thief you move through a deck of cards as a... | Read more »

Price Scanner via MacPrices.net

Apple’s iPhone 6s Tops Best-Selling Smartphon...
In terms of shipments, the iPhone 6s from Apple bested all competitors for sales in 2016, according to new analysis from IHS Markit, a world leader in critical information, analytics and solutions.... Read more
Logitech Rugged Combo Protective iPad Case an...
Logitech has announced its Logitech Rugged Combo, Logitech Rugged Case, and Logitech Add-on Keyboard for Rugged Case for Apple’s new, more affordable $329 9.7-inch iPad, a complete solution designed... Read more
T-Mobile To Offer iPhone 7 and iPhone 7 Plus...
T-Mobile has announced it will offer iPhone 7 and iPhone 7 Plus (PRODUCT)RED Special Edition in a vibrant red aluminum finish. The introduction of this special edition iPhone celebrates Apple’s 10... Read more
9-inch 128GB iPad Pros on sale for $50-$70 of...
B&H Photo has 9.7″ 128GB Apple WiFi iPad Pros on sale for up to $70 off MSRP, each including free shipping. B&H charges sales tax in NY only: - 9″ Space Gray 128GB WiFi iPad Pro: $649 $50... Read more
27-inch iMacs on sale for up to $200 off MSRP...
B&H Photo has 27″ Apple iMacs on sale for up to $200 off MSRP, each including free shipping plus NY sales tax only: - 27″ 3.3GHz iMac 5K: $2099 $200 off MSRP - 27″ 3.2GHz/1TB Fusion iMac 5K: $... Read more
Save up to $600 with Apple refurbished Mac Pr...
Apple has Certified Refurbished Mac Pros available for up to $600 off the cost of new models. An Apple one-year warranty is included with each Mac Pro, and shipping is free. The following... Read more
Save $230 with Apple Certified Refurbished 13...
Apple is now offering Certified Refurbished 2016 13″ 2.0GHz non-Touch Bar MacBook Pros for $230 off original MSRP. An Apple one-year warranty is included with each model, and shipping is free: - 13″... Read more
Apple price trackers, updated continuously
Scan our Apple Price Trackers for the latest information on sales, bundles, and availability on systems from Apple’s authorized internet/catalog resellers. We update the trackers continuously: - 15″... Read more
13-inch Touch Bar MacBook Pros on sale for up...
B&H Photo has the Apple 13″ Touch Bar MacBook Pros in stock today and on sale for up to $150 off MSRP. Shipping is free, and B&H charges NY sales tax only: - 13″ 2.9GHz/512GB Touch Bar... Read more
Today only! 15-inch 2.7GHz Space Gray Touch B...
B&H Photo has the new 2016 15″ 2.7GHz Space Gray Apple Touch Bar MacBook Pro in stock today and on sale for $300 off MSRP for today only. Shipping is free, and B&H charges NY sales tax only... Read more

Jobs Board

*Apple* Retail - Multiple Positions - Apple,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
Director, *Apple* Program - ERP & Cloud...
Leading Pharmaceutical / Biotech Company is announcing a Director, Apple Program - ERP & Cloud Platform Architecture Lead opportunity in Northbrook, IL. Purpose & Read more
Fulltime aan de slag als shopmanager in een h...
Ben jij helemaal gek van Apple -producten en vind je het helemaal super om fulltime shopmanager te zijn in een jonge en hippe elektronicazaak? Wil jij werken in Read more
Starte Dein Karriere-Abenteuer in den Hauptst...
…mehrsprachigen Teams betreust Du Kunden von bekannten globale Marken wie Apple , Mercedes, Facebook, Expedia, und vielen anderen! Funktion Du wolltest schon Read more
*Apple* Retail - Multiple Positions - Apple,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.