|
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
![]() |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
|
#16
|
|||
|
|||
|
[DNO] Food for thought
This contest reminds me of the infamous discs contest.
The duplicates caused major trouble for most people, but the winner realised that there was far too little time to use logic to handle the duplicates when large stacks were used. He handled the duplicates in a totally simple way, and optimised for large stacks. Similarly, the winner of this one will likely use simple logic and optimise the 50x50x8 cases. It surely won't be possible to analyse all potential removals to determine the most promising one on each move, it seems too complex. Lets look at this grid. 123 211 332 The most promising starting moves seem to be (1, 2), (2, 1) and (3, 1). The first two produce scores of 21, and the last produces a score of 23. I don't see any logical way of determining that the third possibility is better than the other two. Of course, thinking like this is a bad idea, because the large grids will determine the winner, not the small ones. |
|
#17
|
|||
|
|||
|
RE: [DNO] Scoring System Benchmark
>$start=time()+microtime();
This timing routine is false ! Suppose you start to use it at 22s 999999. time() will return 22, and microtime() will return 0. So you have one second of difference ! Personally, I use: $time=explode(" ",microtime()); return $time[1]+$time[0]; JC |
|
#18
|
|||
|
|||
|
RE: [DNO] Food for thought
Quote:
Ahhh..but if everyone uses the same dumb algorithm to get through the big ones then the contest will be one with the small ones ;) |
|
#19
|
|||
|
|||
|
RE: [DNO] Scoring System Benchmark
lol
101 seconds on my 566 celeron POS You and your nefangled lotsd of ghz. Too bad new computers cost money, I spent all of 50 bucks on this piece of crap, but hey, it runs |
|
#20
|
||||
|
||||
|
RE: [DNO] Scoring System Benchmark
55,10490500927 seconds
Maybe this Pentium II 450MHz isn't so slow after all. |
|
#21
|
|||||
|
|||||
|
RE: [DNO] Scoring System Benchmark
How about giving some kind of "codewalker rating" when comparing individual progress on contest scripts? Like "my script finishes in 10.3 seconds at a cwr of 1.42854" or a shorter "10.3 s @ 1.42854 cwr". Or you could use your cwr to calculate an estimated time and post that if you prefer.
I edited the original script by Matt by adding the new timelimit setting and cw_rating calculation plus it's echoing: php Code:
BTW: my PIII 450 MHz needs 60 secs to complete. On my P1 166 MHz I wasn't able to get a result in any browser, they all timed out before the script was through ;) Maybe I should give the command line a try... |
|
#22
|
|||
|
|||
|
RE: [DNO] Scoring System Benchmark
Good idea !
But, I get a cwr varying from 2.40 to 2.82. JC |
|
#23
|
|||||
|
|||||
|
RE: [DNO] Scoring System Benchmark
Lets have more realistic results than just a for loop that does nothing. Matt please modify the following code to run at about 30 seconds on the testing machine. As it currently is, it runs on 13.7secs on mine(AthlonXP 1800+)
php Code:
|
|
#24
|
|||
|
|||
|
RE: [DNO] Scoring System Benchmark
On my PII-350 I get 75sec.
How reliable is this time? Is it safe to work whit a timelimit of 75 sec on my computer, and it will roughly (+/- 1sec) get a runtime of 30 sec on the scoring-macine. |
![]() |
| Viewing: Codewalkers Forums > PHP Contests > Older Contests > [DNO] Scoring System Benchmark |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
|
|