|
|
אקסטרים
Started by shinigami at 06-13-2010 0:10. Topic has 35 replies.
  
|
|
Sort Posts:
|
|
|
|
 06-13-2010, 0:10
|
shinigami
Joined on 01-30-2009
Posts 27
|
Re: חוקים חדשים (?) לקודגורו אקסטרים-6
|
|
|
|
|
קלות המימוש היא באמת פונקציה כשיש שנה שלמה להכניס את החוקים החדשים?
|
|
|
|
|
Report
|
|
|
|
|
06-13-2010, 15:08
|
pokop
Joined on 04-30-2010
Posts 2
|
Re: חוקים חדשים (?) לקודגורו אקסטרים-6
|
|
|
|
|
|
אני סבור שיש פה אנשים שישמחו לעזור לממש את השינויים, אני אישית, אשמח לעזור.
|
|
|
|
|
Report
|
|
|
|
|
06-15-2010, 6:26
|
GalDor
Joined on 09-09-2008
Posts 48
|
Re: חוקים חדשים (?) לקודגורו אקסטרים-6
|
|
|
|
|
|
Shinigami, it appears that we are talking about two different things entirely!
I had in mind a command queue: each thread of each survivor pops an opcode off the queue and pushes its next one and state to the bottom (like in RedCode). This seemed to be a reasonable way to implement "slowing". Twice as many threads means that the queue (and waiting time for each thread) is doubled.
In this implementation, if a thread dies during its turn it simply goes off the queue.
What you thought of means putting it in a "dead state" where it does nothing.
The way I saw it the more threads, the slower each one is, but the less threads, the faster each one is - the queue gets cleared as they are killed.
It appears that we had a misunderstanding.
----------------------------------
Have you heard about the new Cray super computer? It’s so fast, it executes an infinite loop in 6 seconds.
|
|
|
|
|
Report
|
|
|
|
|
06-16-2010, 6:56
|
shinigami
Joined on 01-30-2009
Posts 27
|
Re: חוקים חדשים (?) לקודגורו אקסטרים-6
|
|
|
|
|
|
|
|
|
08-16-2010, 15:45
|
shinigami
Joined on 01-30-2009
Posts 27
|
Re: חוקים חדשים (?) לקודגורו אקסטרים-6
|
|
|
|
|
|
אז יהיו חוקים חדשים תחרות הקרובה?
|
|
|
|
|
Report
|
|
|
|
|
08-16-2010, 21:19
|
CGX
Joined on 11-13-2005
Posts 250
|
Re: חוקים חדשים (?) לקודגורו אקסטרים-6
|
|
|
|
|
|
כנראה שלא בתחרות הקרובה, אבל אפשר לדבר (לכל היותר לתחרות הבאה).
|
|
|
|
|
Report
|
|
|
|
|
|
Page 3 of 3 (36 items)
|
< 1 2 3 |
|
|
|
|