21–30 of 43 posts
If you run whois and check linkedin, you can figure out where the author most likely works and what sort of things they do... No names since he probably doesn't want to be googleable.
You can tell the author is the user who submitted this to hacker news.
View source on the home page is interesting too.
I was kind of hoping it would explain what Glyphtree is, but it's a riddle/poem. It has me wondering how 'loser' is defined and if a person can be their own 'friend' ... (read their riddle poem if that makes no sense to you).
The solution given is incorrect. It yields 29 white balls, while the following yields 35. 1 jar1:2 2 3 jar2:3 4 5 6 jar1:2 jar2:4 7 8 9 jar2:6 10 11 12 jar1:11 jar2:3 13 14 15
Honestly, I wish I were on the other end of this. I wonder how many solutions I could find test cases to break even assuming I play nice and allow only positive integers? Yes, I really did imagine all kinds of cases involving zero time and negative time rules (or having zero time to produce anything) and tried to conform them to the spec, but most of them conflict with the output requirements. Not all, though...
View source on the home page is interesting too.
I was kind of hoping it would explain what Glyphtree is, but it's a riddle/poem. It has me wondering how 'loser' is defined and if a person can be their own 'friend' ... (read their riddle poem if that makes no sense to you).
My guess would be that the social graph needs to be planar (e.g embeddable on a plane so that no edges go across eachother).
The world is a sphere can be interpreted in too many ways. One would be that there exists a hamiltonian cycle for the graph and other would be that if you do a depth first search you'd always hit yourself eventually.
My strong guess would be that 2 friends is the least and the most a loser may have.
Biggest problem with too smart puzzles such as this is that there are way too many ways to legitimately interpret them.
This looks like a really cool challenge. Reminds me a bit of the knapsack problem ( http://en.wikipedia.org/wiki/Backpack_problem ) But something tells me the solution is going to be a lot less simple though.
Earlier quoted context omitted.
I was kind of hoping it would explain what Glyphtree is, but it's a riddle/poem. It has me wondering how 'loser' is defined and if a person can be their own 'friend' ... (read their riddle poem if that makes no sense to you).
"the world is a sphere, and friends don't cross each other." My guess would be that the social graph needs to be planar (e.g embeddable on a plane so that no edges go across eachother). The world is a sphere can be interpreted in too many ways. One would be that there exists a hamiltonian cycle for the graph and other would be that if you do a depth first search you'd always hit yourself eventually. My strong guess w…
The solution given is incorrect. It yields 29 white balls, while the following yields 35. 1 jar1:2 2 3 jar2:3 4 5 6 jar1:2 jar2:4 7 8 9 jar2:6 10 11 12 jar1:11 jar2:3 13 14 15
:) you are correct.
BTW, the original solution yields 27 whites: 5 from the start, and then jar1 is used 2+3+3+3=11 times, yielding 22 more.
I noticed the solution in the article is in a "steady state", that can produce 6 whites every 3 steps, or 2 whites per step. The better solution by tlb produces 26 whites in 8 steps, but I didn't check whether it is sustainable (in the sense that after those 8 steps we have enough material to start over).
It's an interesting problem, and I couldn't even model it after a first glance using a graph or linear programming. Will try again later :)
Earlier quoted context omitted.
:) you are correct.
Care to elaborate? Is the solution presented in the original article incorrect? BTW, the original solution yields 27 whites: 5 from the start, and then jar1 is used 2+3+3+3=11 times, yielding 22 more. I noticed the solution in the article is in a "steady state", that can produce 6 whites every 3 steps, or 2 whites per step. The better solution by tlb produces 26 whites in 8 steps, but I didn't check whether it is sus…
Earlier quoted context omitted.
"the world is a sphere, and friends don't cross each other." My guess would be that the social graph needs to be planar (e.g embeddable on a plane so that no edges go across eachother). The world is a sphere can be interpreted in too many ways. One would be that there exists a hamiltonian cycle for the graph and other would be that if you do a depth first search you'd always hit yourself eventually. My strong guess w…
The social graph need not be planar, say if the world is a donut.
Just checked wiki while writing this and toroidal embeddings are a subclass of planar graphs.
So how is this "challenge" more interesting than thousands of problems on SPOJ, UVA, topcoder or project Euler?