>Wrong.

>"He with the most money wins" - Jeff Pace

>Which reminds me. I'm think of promoting a contest, hopefully with the help of the >UT: VFP vs .NET

>Bottom line is that I am willing to put up $50,000.00 that I can develop a >distributed, smart-client, database application (SQL Server, of cource) using VFP9 >which will be faster, more scalable, more reliable, more robust, easier to maintain, >and in less time than the same application developed in .NET using either C# or VB.

>If you want to go more than $50k, I can arrange it. If you want to go less than $50k, >that's fine too but, please, no less than $25k. We will get a third party to spec the >app.

>So, Kevin, are you willing to put $$$ on where you think your mouth is?


>"He with the most options wins"......ModernPrometheus
>
>Kevin
>- Jeff

any solution that requires the serious use of recursion cannot be implemented in VFP.
VFP is a powerful ,but limited tool.

let's make the problem : "discovering if a player playing chess on www.worldchessnetwork.com is using artificial means to elevate their play"

for the world chess network this is an important issue and their entire subscription base relies on the networks ability to stop cheating.

Every move by every player is held in a database.

For the purposes of this discussion we'll assume all the data of all moves made by every subscriber is held in an SQL Server database...