TweetFollow Us on Twitter

Feb 00 Challenge

Volume Number: 16 (2000)
Issue Number: 2
Column Tag: Programmer's Challenge

Programmer's Challenge

by Bob Boonstra, Westford, MA

Web apps with Lasso and FileMaker Pro

Latin Squares

A Latin Square of order N is an NxN array of numbers, where each number from 0..N-1 occurs exactly once in each row and in each column. Your Challenge this month is to construct Latin Squares that are minimal, in the sense that each must form the smallest NxN digit base N number, where the digits are read off column by column, one row at a time.

The prototype for the code you should write is:

#if defined(__cplusplus)
extern "C" {
#endif

void LatinSquares(
  short n,	/* dimension of the Latin Square to be generated */
  short *latinSquare	/* set latinSquare[c + r*n] to square value row r, col c */
);

#if defined(__cplusplus)
}
#endif

For example, 

				1234
				2341
				4123
				3412

is a Latin Square with the value 1234234141233412. It is not the minimal Latin Square of order 4, however, since the following Latin Square,

				1234
				2143
				3412
				4321

forms the number 1234214334124321.

The dimension of the squares you must generate will be less than 2**16. The winner will be the solution that correctly computes minimal Latin Squares in the least amount of execution time. Code size and code elegance, in that order, will be the tiebreakers, in the event two solutions are within 1% of one another in execution time. All Latin Squares must be computed at execution time - entries that precompute solutions will be disqualified.

This month's Challenge was suggested by Aaron Montgomery, who earns 2 Challenge points for making the suggestion

This will be a native PowerPC Challenge, using the CodeWarrior Pro 5 environment. Solutions may be coded in C, C++, or Pascal. Solutions in Java will also be accepted, but Java entries must be accompanied by a test driver that uses the interface provided in the problem statement.

Three Months Ago Winner

Congratulations to Tom Saxton for taking first place in the November, 1999, Putting Green Challenge. While I'm not sure that the next Ryder Cup teams will be beating a path to his door for his four-putting green skills, Tom did soundly beat the three other entries.

The Putting Green Challenge required contestants to analyze a sequence of greens described as three-dimensional points connected into adjoining triangles. Each green had a fixed pin position, and several holes were played on each green from varying initial ball positions. Complicating the Challenger's job was the fact that the propagation model was unknown, available only by observing the results of a putt. For each green, the contestants were given several practice holes that could be used to puzzle out the propagation model. Scoring was based on an award of 100 points for each hole successfully completed, minus 10 points for each stroke taken (not counting practice holes), and minus 10 points for each second of execution time (including practice time).

Two of the solutions submitted did not manage to sink a putt for any of the holes played in my test match. One of those solutions simply hit the ball at the hole very hard, trying to take advantage of a possible ambiguity about ball velocity in the problem statement. I heard from enough real golfers who had rimmed the cup a few times that I had to close the velocity loophole. Tom's winning solution is fairly straightforward. He takes 10 practice shots on the first hole of the first green to estimate the drag coefficients. It does not attempt to analyze the contours of the green or to model the effect of gravity. But the drag model is good enough to put the ball in the hole with only one putt on a level green, and with one or two putts on a flat but gently sloping green.

I used three greens in my test cases, a perfectly flat and level green, a flat but gently sloping green, and a green with more varied terrain. Five practice holes were played on each green, five scored holes on each of the first two greens, and 20 holes on the final green. On the interesting terrain of the last hole, Tom's solution completed each hole successfully, taking up to seven putts to complete the hole.

The table below lists, for each of the solutions submitted, the number of holes successfully completed, the total number of strokes taken on nonpractice holes, total execution time, the total score, and the size and language code parameters. 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 Holes Strokes Time Score Code Data Lang
Tom Saxton (138) 30 117 3.148 1829.969 2224 432 C
Brady Duga 10 49 2.435 509.976 1660 380 C
R. S. 0 60 0.42 -600.004 568 93 C++
J. T. 0 210 197.47 -2101.975 2580 255 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 237
2. Saxton, Tom 146
3. Maurer, Sebastian 67
4. Rieken, Willeke 51
5. Heithcock, JG 43
6. Shearer, Rob 41
7. Boring, Randy 39
8. Brown, Pat 20
9. Hostetter, Mat 20
10. Jones, Dennis 12
11. Hart, Alan 11
12. Duga, Brady 10
13. Hewett, Kevin 10
14. Murphy, ACC 10
14. Selengut, Jared 10
16. Smith, Brad 10
17. Strout, Joe 10
18. Varilly, Patrick 10

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 Tom's winning Putting Green solution:

PuttingGreen.c
Copyright © 1999 Tom Saxton

#include "PuttingGreen.h"

#include <stdlib.h>
#include <math.h>

enum
{
	fFalse = 0,
	fTrue = TRUE
};
#define DIM(a) (sizeof(a)/sizeof((a)[0]))

// disable asserts
#define Assert(f)

// vector types and constants
typedef struct Point3DDouble VEC;
static const double epsilon = 1.0e-7;
static const VEC s_normalZ = { 0, 0, 1.0 };
static const VEC s_vecZero;

// this green

static Point3DDouble *s_paposGrid;
static int s_cposGrid;
static MyTriangle *s_patri;
static int s_ctri;
static int s_itriPin;
static Point3DDouble s_posPin;

static int s_cholePractice;			// number of practice putts
static int s_choleScored;				// number of scored putts

// computed physical constants for this green
static int s_fGetDrag = fTrue;
static double mDrag, bDrag;

// current state

static int s_ihole;						// which hole are we on?
static int s_cputt;						// which putt is this
static int s_fPractice;				// is this a practice putt?
static Point3DDouble s_posCur;	// where's the ball?

// the current putt

static double s_svInitial;
static double s_distExpect;

// vector utilities

static void _SubVec(VEC pos1, VEC pos2, VEC *pposResult);
static double _DotVec(VEC vec1, VEC vec2);
static double _LenVec(VEC vec);
static void _ScaleVec(VEC vec, double s, VEC *pvecResult);

// triangle utilities

static void _GetMidTriPos(int itri, Point3DDouble *ppos);

//
// Entry Points
//
#if 0
static void ___Entry_Points(){}
#endif

InitGreen

void InitGreen(
	Point3DDouble paposGrid[],	/* green terrain description */
	long cposGrid,	/* number of points */
	MyTriangle patri[],	/* triangles comprising the green */
	int ctri,	/* number of triangles */
	long itriPin,	/* index in triangles[] of the pin on this green */
	long cholePractice,	/* number of unscored (but timed) holes to 			   practice on this green */
	long choleScored	/* number of holes to be scored on this green */
)

{
	s_paposGrid = paposGrid;
	s_cposGrid = cposGrid;
	s_patri = patri;
	s_ctri = ctri;
	s_itriPin = itriPin;
	
	s_cholePractice = cholePractice;
	s_choleScored = choleScored;
	
	_GetMidTriPos(itriPin, &s_posPin);
	
	s_ihole = 0;
}
	
#pragma warn_unusedarg off

StartHole

void StartHole(	/* called to start play on this hole */
	Point3DDouble posStart, 	/* initial ball position on the green */
	Boolean fPractice	/* TRUE if this hole is practice */
)
{
	++s_ihole;
	
	s_posCur = posStart;
	s_cputt = 0;
	s_fPractice = fPractice;
}

#pragma warn_unusedarg reset

#define cputtPractice 10
#define cputtScore    10

typedef struct SD SD;
struct SD
{
	double speed;
	double dist;
};
static SD s_asd[cputtPractice];
static int s_csd;

MakePutt

Boolean 		/* quit */ MakePutt(
	Velocity2DDouble *pvXY		/* return initial ball velocity in the z==0 plane */
)
{
	double dist;
	Point3DDouble vXY;
		
	if (s_cputt >= (s_fPractice ? cputtPractice : cputtScore))
	{
		if (s_fGetDrag)
		{
			int isd;
			double sumX, sumY, sumXY, sumXX;
			
			Assert(s_csd > 0);

			// do linear regression on the data

			sumX = sumY = sumXY = sumXX = 0;
			for (isd = 0; isd < s_csd; ++isd)
			{
				SD *psd = &s_asd[isd];
				double y = psd->dist;
				double x = fabs(psd->speed);
				
				sumXX += x * x;
				sumXY += x * y;
				sumX += x;
				sumY += y;
			}
			
			mDrag = (sumX*sumY - s_csd*sumXY)/(sumX*sumX - s_csd*sumXX);
			bDrag = (sumY - mDrag*sumX)/s_csd;
			
			Assert(0.0 <= mDrag && mDrag <= 5.0);
			Assert(-5.0 <= bDrag && bDrag <= 5.0);

			s_fGetDrag = fFalse;
		}
		
		// give up

		return fTrue;
	}
	
	// just give up after we've finished with practice shots

	if (s_fPractice && !s_fGetDrag)
		return fTrue;

	_SubVec(s_posPin, s_posCur, &vXY);
	vXY.z = 0;
	dist = _LenVec(vXY);
	
	if (s_fGetDrag)
	{
		s_svInitial = 3.0*(1.0 + s_cputt/2);
		if (s_cputt % 2)
			s_svInitial = -s_svInitial;
	}
	else
	{
		s_svInitial = (dist + 0.03 - bDrag) / mDrag;
		s_distExpect = dist;
	}
	_ScaleVec(vXY, s_svInitial/dist, &vXY);
	
	pvXY->x = vXY.x;
	pvXY->y = vXY.y;

	return fFalse; // keep going
}

BallMovement

void BallMovement(
	BallPosition papos4[],	/* provides ball movement in response to MakePutt */
	int cpos,	/* number of ball positions provided */
	Boolean fInHole	/* true if the ball went into the hole */
)
{
	Point3DDouble posNew;
	
	posNew = papos4[cpos-1].pt;
	
	if (!fInHole)
	{
		double dist;
		Point3DDouble vecMove;
			
		_SubVec(posNew, s_posCur, &vecMove);
		dist = _LenVec(vecMove);

		if (s_fGetDrag)
		{
			Assert(0 <= s_csd && s_csd < DIM(s_asd));
			s_asd[s_csd].speed = fabs(s_svInitial);
			s_asd[s_csd].dist = dist;
			++s_csd;
		}
	}

	s_posCur = posNew;
		
	++s_cputt;
}

//
// Vector Functions
//

#if 0
static void ___Vector_Functions(){}
#endif

_SubVec

static void _SubVec(VEC pos1, VEC pos2, VEC *pposResult)
{
	pposResult->x = pos1.x - pos2.x;
	pposResult->y = pos1.y - pos2.y;
	pposResult->z = pos1.z - pos2.z;
}

_DotVec

static double _DotVec(VEC vec1, VEC vec2)
{
	return vec1.x * vec2.x + vec1.y * vec2.y + vec1.z * vec2.z;
}

_LenVec

static double _LenVec(VEC vec)
{
	return sqrt(_DotVec(vec, vec));
}
_ScaleVec

static void _ScaleVec(VEC vec, double s, VEC *pvecResult)
{
	pvecResult->x = s * vec.x;
	pvecResult->y = s * vec.y;
	pvecResult->z = s * vec.z;

}

_GetMidTriPos

static void _GetMidTriPos(int itri, Point3DDouble *pposMid)
{
	MyTriangle tri;
	int iipos;
	
	Assert(0 <= itri && itri < s_ctri);
	tri = s_patri[itri];
	
	*pposMid = s_vecZero;
	
	for (iipos = 0; iipos < DIM(tri.pointIndices); ++iipos)
	{
		Point3DDouble *ppos;
		
		Assert(0 <= tri.pointIndices[iipos] && 
										tri.pointIndices[iipos] < s_cposGrid);
		ppos = &s_paposGrid[tri.pointIndices[iipos]];
		
		pposMid->x += ppos->x;
		pposMid->y += ppos->y;
		pposMid->z += ppos->z;
	}
	
	pposMid->x *= 1.0/3.0;
	pposMid->y *= 1.0/3.0;
	pposMid->z *= 1.0/3.0;
}
 

Community Search:
MacTech Search:

Software Updates via MacUpdate

Logitech Control Center 3.9.2 - Keyboard...
Logitech Control Center (LCC) is designed to support OS X and allows you to take full advantage of your Logitech keyboard, mouse, or trackball. With the LCC you can: Browse the Internet using... Read more
Adobe Acrobat Pro 15.007.20033 - Powerfu...
Acrobat Pro DC is available only as a part of Adobe Creative Cloud, and can only be installed and/or updated through Adobe's Creative Cloud app. Adobe Acrobat Pro DC with Adobe Document Cloud... Read more
CleanMyMac 3.0.1 - Delete files that was...
CleanMyMac makes space for the things you love. Sporting a range of ingenious new features, CleanMyMac lets you safely and intelligently scan and clean your entire system, delete large, unused files... Read more
Evernote 6.0.10 - Create searchable note...
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
CleanApp 5.0.1 - Application deinstaller...
CleanApp is an application deinstaller and archiver.... Your hard drive gets fuller day by day, but do you know why? CleanApp 5 provides you with insights how to reclaim disk space. There are... Read more
Quicken 2015 2.5.0 - Complete personal f...
Quicken 2015 helps you manage all your personal finances in one place, so you can see where you're spending and where you can save. Quicken automatically categorizes your financial transactions,... Read more
Tonality Pro 1.1.4 - Professional-grade...
Tonality Pro gives you the power to create stunning and dramatic black & white images. This is a complete monochrome image editor with more than 150 one-click style presets, totally unique... Read more
Adobe Photoshop CC 2014 15.2.2 - Profess...
Photoshop CC 2015 is available as part of Adobe Creative Cloud for as little as $19.99/month (or $9.99/month if you're a previous Photoshop customer). Photoshop CS6 is still available for purchase (... Read more
BBEdit 11.1 - Powerful text and HTML edi...
BBEdit is the leading professional HTML and text editor for the Mac. Specifically crafted in response to the needs of Web authors and software developers, this award-winning product provides a... Read more
Together 3.4.3 - Store and organize all...
Together helps you organize your Mac, giving you the ability to store, edit and preview your files in a single clean, uncluttered interface. Smart storage. With simple drag-and-drop functionality,... Read more

The Enchanted Cave 2 (Games)
The Enchanted Cave 2 2.1 Device: iOS Universal Category: Games Price: $2.99, Version: 2.1 (iTunes) Description: Delve into a strange cave with a seemingly endless supply of treasure, strategically choosing your battles to gather as... | Read more »
Crystal Siege is on Sale With a New Univ...
Crystal Siege,  FDG Entertainment's RPG  Tower Defense game, has gone universal in its latest update. [Read more] | Read more »
Oh My Pixel! We Go Hands-on With The Kni...
I recently had a chance to play around with the upcoming Knights of Pen & Paper 2 from Paradox Interactive. I was a huge fan of the first game, so I had a lot of expectations going into it - and I wasn't disappointed. The game has gotten some... | Read more »
Throw Out Your Stylus and Sketch With Pe...
Penpoint Drawing, by Damin Liu,  is a new creative drawing app that uses your finger as your stylus. [Read more] | Read more »
Oceanhouse has Released Just So Thankful...
Oceanhouse Media, makers of digital book apps, are celebrating Mother's Day with a giveaway and a new app. [Read more] | Read more »
Get Dressed, the Virtual Wardrobe App fo...
Dressed, by  Kabuki Vision, is one of the first fashion apps for the Apple Watch. It pairs your watch with your iPhone to let you browse garments from your closet and mix and match them to create the perfect outfit. To add new pieces you just use... | Read more »
Show Everyone Who the Pack Master is in...
HeroCraft has added the new PvP Arena mode to  Warhammer 40,000: Space Wolf. Now you'll be able to go up against wolves around the world in intense  3-v-3 battles. As you battle the stages will get harder, but you'll get amazing rewards and climb... | Read more »
Jurassic World: The Game - Tips, Tricks,...
You’ve probably already got a huge and incredibly popular theme park in Jurassic Park Builder. That’s great, but Jurassic World: The Game is a slightly different beast. This time around you’ll be spending a lot more time in the Arena, and will have... | Read more »
Battledots (Games)
Battledots 1.00 Device: iOS Universal Category: Games Price: $.99, Version: 1.00 (iTunes) Description: Battledots is an intense, fast-paced strategy game where you must attack the opponent while defending your base, and everything is... | Read more »
Stella's Journey (Games)
Stella's Journey 1.1 Device: iOS Universal Category: Games Price: $2.99, Version: 1.1 (iTunes) Description: "The concept is neat and fun to play around with" - TouchArcade"Aside from looking fantastic, the game offers some very... | Read more »

Price Scanner via MacPrices.net

Sale! New 13-inch 256GB MacBook Air for $1099...
B&H Photo has the new 2015 13″ 1.6GHz/256GB MacBook Air on sale for $1099.99 including free shipping plus NY tax only. Their price is $100 off MSRP. Read more
Japan Post Group, IBM and Apple Deliver iPads...
Japan Post Group, IBM and Apple executives meeting in in New York City yesterday announced a first-of-its-kind initiative aimed at improving the quality of life for millions of Japanese senior... Read more
Worldwide Tablet Market Contracts For Second...
Worldwide tablet shipments recorded a second consecutive quarter of year-over-year decline in the first calendar quarter of 2015 (1Q15), according to preliminary data from the International Data... Read more
Apple restocks refurbished Mac minis for up t...
The Apple Store has restocked Apple Certified Refurbished 2014 Mac minis, with models available starting at $419. Apple’s one-year warranty is included with each mini, and shipping is free: - 1.4GHz... Read more
13-inch 2.5GHz MacBook Pro available for $999...
Adorama has the 13-inch 2.5GHz MacBook Pro on sale for $999 including free shipping plus NY & NJ sales tax only. Their price is $100 off MSRP. Read more
New 13-inch Retina MacBook Pros available for...
Save up to $80 on the purchase of a new 2015 13″ Retina MacBook Pro at the following resellers. Shipping is free with each model: 2.7GHz/128GB MSRP $1299 2.7GHz/256GB... Read more
15-inch 2.2GHz Retina MacBook Pro (Apple refu...
The Apple Store has restocked Apple Certified Refurbished 15″ 2.2GHz Retina MacBook Pros for $1699 including free shipping plus Apple’s standard one-year warranty. Their price is $300 off MSRP, and... Read more
1.4GHz Mac mini, refurbished, available for $...
The Apple Store has Apple Certified Refurbished 1.4GHz Mac minis available for $419. Apple’s one-year warranty is included, and shipping is free. Their price is $80 off MSRP, and it’s the lowest... Read more
Sale! 15-inch Retina MacBook Pros for up to $...
MacMall has 15″ Retina MacBook Pros on sale for up to $255 off MSRP. Shipping is free: - 15″ 2.2GHz Retina MacBook Pro: $1794.99 save $205 - 15″ 2.5GHz Retina MacBook Pro: $2244.99 save $255 B&H... Read more
Sale! New 11-inch 128GB MacBook Air for $799,...
B&H Photo has the new 2015 11″ 1.6GHz/128GB MacBook Air on sale for $799.99 including free shipping plus NY tax only. That’s $100 off MSRP. Read more

Jobs Board

*Apple* Solutions Consultant - Retail Sales...
**Job Summary** The ASC is an Apple employee who serves as the Apple business manager and influencer in a hyper-business critical Reseller's store which delivers Read more
Technical Project Manager - *Apple* Pay - A...
**Job Summary** Apple Pay is seeking an experienced technical PM…manage the rollout of features to merchants for the Apple Pay platform in the US Within this role Read more
Software Engineer, *Apple* Watch - Apple (U...
…the team that is revolutionizing the watch! As a software engineer on the Apple Watch team, you will be responsible for building world-class applications and frameworks Read more
*Apple* Retail - Multiple Positions(US) - Ap...
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
*Apple* System Administrator - Columbia Univ...
Advertised Summary Job Description: The role of the Apple System Administrator is to install and maintain our Mac and iOS Devices at the Medical Center using Casper Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.