> http://go/codegolf How does this work, some sort of TLD magic? (That shouldn't be possible, right?) Is it just routed within Google's internal network?
Search paths. The full address is go.corp.google.com (which is simply a URL shortener), IIRC; however, I think the resolvers are also configured to respond to a bare name in a lot of cases as an optimization. They talk a little bit about corp in their BeyondCorp paper[0], which is well worth a read, and I'm speaking to ancient memory so I might be wrong these days. [0]: http://static.googleusercontent.com/media/resea…
Code Golf at Google
11–20 of 38 posts
Re: Code Golf at Google
#12i think the sad pattern I see in a lot of these code golf implementations is the solution score is based on Lines of Code, which we already agree is a POOR representation of either complexity or simplicity. I think it would be far more interesting to measure number of instructions to complete the objective. Though I suspect the folks familiar with assembly would run circles, perhaps you could segment by solution lang…
http://www.hugi.scene.org/compo/
That one seems abandoned for a few years now but you can find plenty of tiny graphical effects here, executables are 512 bytes and below:
http://www.pouet.net/prodlist.php?type%5B%5D=32b&type%5B%5D=...
Re: Code Golf at Google
#13i think the sad pattern I see in a lot of these code golf implementations is the solution score is based on Lines of Code, which we already agree is a POOR representation of either complexity or simplicity. I think it would be far more interesting to measure number of instructions to complete the objective. Though I suspect the folks familiar with assembly would run circles, perhaps you could segment by solution lang…
Re: Code Golf at Google
#14i think the sad pattern I see in a lot of these code golf implementations is the solution score is based on Lines of Code, which we already agree is a POOR representation of either complexity or simplicity. I think it would be far more interesting to measure number of instructions to complete the objective. Though I suspect the folks familiar with assembly would run circles, perhaps you could segment by solution lang…
Re: Code Golf at Google
#15Re: Code Golf at Google
#16i think the sad pattern I see in a lot of these code golf implementations is the solution score is based on Lines of Code, which we already agree is a POOR representation of either complexity or simplicity. I think it would be far more interesting to measure number of instructions to complete the objective. Though I suspect the folks familiar with assembly would run circles, perhaps you could segment by solution lang…
You may be interested in http://www.zachtronics.com/tis-100/ . It's essentially a code golf game with many different metrics to optimize including number of instructions.
Re: Code Golf at Google
#17Re: Code Golf at Google
#18Re: Code Golf at Google
#19i think the sad pattern I see in a lot of these code golf implementations is the solution score is based on Lines of Code, which we already agree is a POOR representation of either complexity or simplicity. I think it would be far more interesting to measure number of instructions to complete the objective. Though I suspect the folks familiar with assembly would run circles, perhaps you could segment by solution lang…
You may be interested in http://www.zachtronics.com/tis-100/ . It's essentially a code golf game with many different metrics to optimize including number of instructions.
Re: Code Golf at Google
#20i think the sad pattern I see in a lot of these code golf implementations is the solution score is based on Lines of Code, which we already agree is a POOR representation of either complexity or simplicity. I think it would be far more interesting to measure number of instructions to complete the objective. Though I suspect the folks familiar with assembly would run circles, perhaps you could segment by solution lang…