I've got a better idea. I think that the people at www.flashdaddee.com want to kick your butts. How about cprogramming vs flashdaddee contest.
And we're not talking any pig mutton contest either, we are talking about a high level Windows application. The time frame is 3 months from the agreed upon acceptance of the challenge.
I think that my cynicism wasn't clear.
TK: I'm not sure if I don't understand you or if you don't understand me anyway, who cares?
I've got an idea, how about lets not, and pretend we did.How about cprogramming vs flashdaddee contest.
Visit entropysink.com - It's what your PC is made for!
we don't even have one contest up and finished yet. let's do one (or more) before branching out
Since finals are almost over soon...
What about this for a project. Take a graphs such as http://www.lib.utexas.edu/maps/world..._york_city.jpg
and find the shortest path.
Using this map, reading the data would be almost impossible but if we created a map by a drawing program using a somewhat fixed format for the roads and lettering for the cities it should be possible.
Oh, I think this is more than difficult!
thanks for the offer webmaster, but we don't need it. if we do, i'll let you know.
to nick: that's too hard for the first contest. maybe something simpler, like creating a map made of pointers and nodes, then finding the fastest route.
It's too easy. BTW where is the big whole in New York city where the twin towers once stood? That's not a good map buddy.
Once you have the map read into your graph, it's easy to find the shortest path. Reading it in is really the only hard part. The New York map would be really hard to do because you would have to determine the names of the cities from faded letters etc. If we had a map with the roads colored the same color, the cities all marked with the same size and color circle, and all the lettering exactly the same it wouldn't be too hard. Perhaps we should have two contest. One where the paths and distances are given in a text file and another where you must read them in from a bitmap?