Sponsored by NuSphere - PHP Software for PHP Application Developers - On Sale This Week for $100



Go Back   PHP-Editors > Programming Contests > PHP Programming Contests

PHP Programming Contests Everything to do with the PHP Programming Contests.

Reply
 
LinkBack Thread Tools Display Modes
  #1 (permalink)  
Old 2003-07-29, 01:27 AM
Junior Member
 
Join Date: May 2003
Posts: 3
miclaro
Default

1) will there be many problems in one file or only one? (map, routes)

2) allways uppercase?

3) max cost (or what number can i use for infinite?)

that's it,
this answered and i send my code...

ps: can i sugest for future contest a form for uploading the zip file, instead of sending the mail, i could easily see that que submit was done ok...
(it could be the A5 contest...)

bye.
Reply With Quote
Sponsored Links
  #2 (permalink)  
Old 2003-07-30, 09:03 AM
stuart's Avatar
Administrator
 
Join Date: Jan 2003
Location: Scotland
Posts: 472
stuart will become famous soon enoughstuart will become famous soon enough
Send a message via MSN to stuart
Default

In answer to your questions:

1. No, just the one in a file.
2. Well, as I said in an other post a=A, its not case sensitive.
3. ??? - not sure what your meaning here, please explain.


- I have been looking to have a contest submit form, but havn't got round to doing one yet. Thanks for your suggestion though

Stuart
Reply With Quote
  #3 (permalink)  
Old 2003-07-30, 04:02 PM
Junior Member
 
Join Date: Jun 2003
Location: Sacramento, CA, USA
Posts: 9
lrutledge
Send a message via AIM to lrutledge
Default

I'd like to know the answer to question number 3 also. I believe the question is what is the maximum value we should expect for a route length? With A* path finding algorithms you assign an "infinity" value to unused node's that is larger than the largest expected value (i.e. 32767).

Thanks,
Larry
Reply With Quote
  #4 (permalink)  
Old 2003-07-30, 06:21 PM
Member
 
Join Date: Apr 2003
Location: Poland
Posts: 41
cagrET
Default

i dont know if find time to participate in this contest, so ppl u have chance to win
(probably :])

have fun all
Reply With Quote
  #5 (permalink)  
Old 2003-07-30, 08:52 PM
Junior Member
 
Join Date: May 2003
Posts: 3
miclaro
Default

Quote:
Originally posted by lrutledge@Jul 30 2003, 08:01 PM
I'd like to know the answer to question number 3 also. I believe the question is what is the maximum value we should expect for a route length? With A* path finding algorithms you assign an "infinity" value to unused node's that is larger than the largest expected value (i.e. 32767).

Thanks,
Larry
that's what i meant:

3) what is the maximum cost to expect.

and now a general contest question:
4) can i participate with 2 scripts or it's only 1 script per user?

i mean this, becouse i can have 2 kind of scripts:
a) the perfect solution, take a long time
B) the quickest, imperfect one.
so depending on the input i could win with a) or B)....
it would be nice to submit 2 versions...
Reply With Quote
  #6 (permalink)  
Old 2003-07-31, 03:55 AM
Junior Member
 
Join Date: Jun 2003
Posts: 12
ciaccia
Default

Quote:
Originally posted by miclaro@Jul 31 2003, 12:52 AM
4) can i participate with 2 scripts or it's only 1 script per user?
I don't think it would be fair to let people partecipate with more than one script, so I'm quite sure it is not allowed
__________________
Matteo Beccati
www.phpadsnew.com
www.phppgads.com
Reply With Quote
  #7 (permalink)  
Old 2003-08-01, 03:56 AM
stuart's Avatar
Administrator
 
Join Date: Jan 2003
Location: Scotland
Posts: 472
stuart will become famous soon enoughstuart will become famous soon enough
Send a message via MSN to stuart
Default

Quote:
Originally posted by miclaro+Jul 31 2003, 12:52 AM--></span><table border='0' align='center' width='95%' cellpadding='3' cellspacing='1'><tr><td>QUOTE (miclaro @ Jul 31 2003, 12:52 AM)</td></tr><tr><td id='QUOTE'> <!--QuoteBegin--lrutledge@Jul 30 2003, 08:01 PM
I'd like to know the answer to question number 3 also. I believe the question is what is the maximum value we should expect for a route length? With A* path finding algorithms you assign an "infinity" value to unused node's that is larger than the largest expected value (i.e. 32767).

Thanks,
Larry
that's what i meant:

3) what is the maximum cost to expect.

and now a general contest question:
4) can i participate with 2 scripts or it's only 1 script per user?

i mean this, becouse i can have 2 kind of scripts:
a) the perfect solution, take a long time
B) the quickest, imperfect one.
so depending on the input i could win with a) or B)....
it would be nice to submit 2 versions... [/b][/quote]
OK I see know -

Well I can't give you the exact figure but I guess no more than if you use 1000 as a max you will be fine
I don't intent having a huge map.

As for your other question about submittions per user - only one entry per user is the only way, otherwise everyone could submit 10 seperate methods and that would suck in many ways

Hope this helps
-stuart
Reply With Quote
  #8 (permalink)  
Old 2003-08-09, 02:46 AM
Junior Member
 
Join Date: Aug 2003
Posts: 5
jayant
Default

Distances wont be negetive, so use any negetive value as infinity
Reply With Quote
Must read Review for Serious PHP Developers


NuSphere PhpED 5.5 : The Staff of php-editors.com recently spent a few days working with NuSphere PhpED 5.5 (a popular PHP IDE) and NuCoder 2.0 (a PHP Encoding Utility), read up on all the details.

Sponsored Links
Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are On



All times are GMT -5. The time now is 11:58 PM.


Powered by vBulletin® Version 3.7.2
Copyright ©2000 - 2008, Jelsoft Enterprises Ltd.
LinkBacks Enabled by vBSEO 3.1.0
© Copyright 2003-2008 www.php-editors.com. The ultimate PHP Editor and PHP IDE site.