• [ENDED] Code Golf - The Reboot #3 5 1
Currently:  

Author Topic: [ENDED] Code Golf - The Reboot #3  (Read 30780 times)

0 Members and 1 Guest are viewing this topic.

Offline Juju

  • Incredibly sexy mare
  • Coder Of Tomorrow
  • LV13 Extreme Addict (Next: 9001)
  • *************
  • Posts: 5730
  • Rating: +500/-19
  • Weird programmer
    • View Profile
    • juju2143's shed
Re: Code Golf - The Reboot #3
« Reply #30 on: June 21, 2015, 07:23:58 pm »
IMO, 11:59:59 PM ET Sunday would probably be better for those who don't have time through the week.

Remember the day the walrus started to fly...

I finally cleared my sig after 4 years you're happy now?
THEGAME
This signature is ridiculously large you've been warned.

The cute mare that used to be in my avatar is Yuki Kagayaki, you can follow her on Facebook and Tumblr.

Offline Scipi

  • Omni Kitten Meow~ =^ω^=
  • LV10 31337 u53r (Next: 2000)
  • **********
  • Posts: 1547
  • Rating: +192/-3
  • Meow :3
    • View Profile
    • ScipiSoftware
Re: [ENDED, UPDATED RESULTS MONDAY] Code Golf - The Reboot #3
« Reply #31 on: June 22, 2015, 12:56:03 am »
IMO, 11:59:59 PM ET Sunday would probably be better for those who don't have time through the week.

I thought the deadline ended Sundays O.O

I agree, though, it would make more sense for the deadline to be Sunday rather than Saturday.

Imma Cat! =^_^= :3 (It's an emoticon now!)
Spoiler For Things I find interesting:
Spoiler For AI Programming:
Spoiler For Shameless advertising:

Spoiler For OldSig:





Spoiler For IMPORTANT NEWS!:
Late last night, Quebec was invaded by a group calling themselves, "Omnimaga". Not much is known about these mysterious people except that they all carried calculators of some kind and they all seemed to converge on one house in particular. Experts estimate that the combined power of their fabled calculators is greater than all the worlds super computers put together. The group seems to be holding out in the home of a certain DJ_O, who the Omnimagians claim to be their founder. Such power has put the world at a standstill with everyone waiting to see what the Omnimagians will do...

Wait... This just in, the Omnimagians have sent the UN a list of demands that must be met or else the world will be "submitted to the wrath of Netham45's Lobster Army". Such demands include >9001 crates of peanuts, sacrificial blue lobsters, and a wide assortment of cherry flavored items. With such computing power stored in the hands of such people, we can only hope these demands are met.

In the wake of these events, we can only ask, Why? Why do these people make these demands, what caused them to gather, and what are their future plans...

Offline Runer112

  • Moderator
  • LV11 Super Veteran (Next: 3000)
  • ***********
  • Posts: 2289
  • Rating: +639/-31
    • View Profile
Re: [ENDED] Code Golf - The Reboot #3
« Reply #32 on: June 22, 2015, 01:10:42 pm »
Not to try to nitpick, but I feel obligated to point out that Haobo's solution does not wholly satisfy rule 4: "... every cell's initial state ... must be independent (barring reasonable PRNG limitations) of every other cell's initial state." The reason I suggested this clause was to prevent simple "randomization" implementations that do not provide at least somewhat convincing randomization. Regrettably, this solution's clever approach of simply using a randomly chosen 768-byte block of memory as the initial state does not satisfy this.

A heuristic proof of this could cite that memory almost always contains meaningful, structured data. As a particuarly apparent example, memory often contains large stretches of zeroes. If one such large stretch were contained in the initial state, then a pixel's probability of starting dead is greatly increased if the byte(s) immediately before it are all zero. This constitutes dependence. And also a pretty boring game of life, which is why the clause was proposed.

Although less apparent on structured data that's not just a stretch of zeroes, the same dependence and insufficient randomness exists in any non-chaotic data. So to extend this heuristic proof to a definitive one, one can prove that non-chaotic data exists in memory. And this can be done by citing the existence of the program itself in memory.

I came down on lirtosiast and pbfy0 earlier about skirting around this clause, so I thought it to only be fair that I come down here as well. I even came down on myself by proposing this clause in the first place, as I was considering using such a "randomization" approach but considered it against the spirit of the prompt.
« Last Edit: June 22, 2015, 01:28:54 pm by Runer112 »

Offline c4ooo

  • Project Author
  • LV5 Advanced (Next: 300)
  • *****
  • Posts: 252
  • Rating: +10/-1
  • The impossible chemical compound.
    • View Profile
Re: [ENDED] Code Golf - The Reboot #3
« Reply #33 on: June 22, 2015, 01:34:10 pm »
Not to try to nitpick, but I feel obligated to point out that Haobo's solution does not wholly satisfy rule 4: "... every cell's initial state ... must be independent (barring reasonable PRNG limitations) of every other cell's initial state." The reason I suggested this clause was to prevent simple "randomization" implementations that do not provide at least somewhat convincing randomization. Regrettably, this solution's clever approach of simply using a randomly chosen 768-byte block of memory as the initial state does not satisfy this.

A heuristic proof of this could cite that memory almost always contains meaningful, structured data. As a particuarly apparent example, memory often contains large stretches of zeroes. If one such large stretch were contained in the initial state, then a pixel's probability of starting dead is greatly increased if the byte(s) immediately before it are all zero. This constitutes dependence. And also a pretty boring game of life, which is why the clause was proposed.

Although less apparent on structured data that's not just a stretch of zeroes, the same dependence and insufficient randomness exists in any non-chaotic data. So to extend this heuristic proof to a definitive one, one can prove that non-chaotic data exists in memory. And this can be done by citing the existence of the program itself in memory.
+1 for that proof ( or attempt of)  :thumbsup:

However, I would like to warn you that you are on unsure footing. First you "criticized" @lirtosiast's answer and now you are trying to do the same with @Haobo's I fully trust, being the person you are, that you are doing this for the good and fairness of the game/community However if someone puts two and two together, it may seam to the  that you are trying to discourage completion :P just saying, not trying to attack you or anything. (Reread what I said in bold :P )
« Last Edit: June 22, 2015, 01:42:25 pm by c4ooo »
-German Kuznetsov
The impossible chemical compound.

Offline TIfanx1999

  • ಠ_ಠ ( ͡° ͜ʖ ͡°)
  • CoT Emeritus
  • LV13 Extreme Addict (Next: 9001)
  • *
  • Posts: 6173
  • Rating: +191/-9
    • View Profile
Re: [ENDED] Code Golf - The Reboot #3
« Reply #34 on: June 29, 2015, 02:13:14 am »
Well obviously, I didn't have time to finish. I still wanted to finish it (even if it was late) and post my attempt. Unfortunately, I got really sick and haven't been doing much of anything recently. I hope to revisit this in a bit and finish it or at least post an explanation of what i was going to attempt.