Well, this is 3160 nodes closer than the last time someone asked. I suppose a god could analyze node creation patterns and come up with a good estimate?
| [reply] |

When does the guessing close?
Update: quoting from When will the 500.000th node appear?:
Update: PPS: Since it would be daft to allow people to continue guessing right up until the actual 500.000th node is created, I'm adding an arbitrary limit of 1 week after this node was posted.
**Update:** I decided to collect here the list of all similar pools because it seems that such a list doesn't yet exist (except as a linked list form).
Cref. http://en.wikipedia.org/wiki/WP:2MP
Update: quoting from the im2 homenode:
To submit guesses when the 600.000th node will appear: `/msg im2 guess 600_000 <datetime>`
Guesses will be parsed with Time::ParseDate::parsedate, and will assume GMT per default.
Update: changed "poll" to "pool".
Update: the 600000th node came out on **Feb 14, 2007 at 17:18:36 UTC**: it's 600000 nodes by liverpole. im2 still accepts guesses as of Feb 14 19:33 UTC.
| [reply] [d/l] |

That's a good question.. But since I started quite late, how about we come up with an algorithm that will relate the guess to the closeness of the actual result.
So, another challenge, given the date of the actual 600k node, the date guessed, and the date they guessed it on.. Produce a fair result.. somehow ;)
C.
| [reply] |

Good idea. I'll try to think about the formula but maybe someone more knowledgable about maths statistics can tell it rightaway.
There should still be a closing of the guesses because very short time before node 600_000 appears the model used for the formula will get unusable because the guesser can influence the date (by posting the 600_000th post himself).
And, obviously, there's no point to guess after the 600_000th node came out. (Update. Let me clarify that you needn't take a given date to stop accepting votes at, it could instead be when a given node id is created.)
Update. Let me try to build a model.
Suppose that the nodes on perlmonks get created periodically with exactly tau time between them, where tau is a statistical parameter. Now if the current node is 600_000 - k, then the actual time of node 600_000 is now + k * tau. If your estimate on tau is tau_hat, then you will guess now + k * tau_hat. I think we can suppose that you do not get any new information on the parameter tau as time progresses, so the mistake of your guess will be linearly proportional with k, or (equivalently) with the time between your guess and the creation time of node 600_000. Thus, our formula should simply divide the mistake of the guess with either k (which is 600_000 minus the id of the node posted at the same time as the guess was made), or the difference between the time of the guess and the time of 600_000.
The problem with this argument is, that as we get closer to node 600_000, our model gets more and more inaccurate, and in reality even knowing the parameters of the distribution of posting times on perlmonks, you can't know the 600_000 date certainly. At that point, our problem becomes a complicated problem that is both statistical and probability theoretical in nature, and I've no idea how to solve it. (At that point, you probably had to actually make a guess on tau, which we did not need above.)
So if anyone has better solutions, just tell.
| [reply] |

I think node 666_666 is more portentous. :-) And WHO will post it?...... bwahahaha.
| [reply] |

| [reply] |

It looks like ambrus has the closest guess, to me anyways.. Prize to be dispatched shortly ;)
C. | [reply] |