Web Hosting

Ahyoheek Notes

Authored by Isyldar on May 27, 2007

Robert F. Caine and myself (Isyldar) decided to conduct some experiments on the Ahyoheek tables to determine if we could figure a few things out, which to this day do not seem to have any kind of documentation whatsoever.

So, here are the questions that we’ve answered so far:

What happens if I lose all of my Ahyoheek points?

Should you lose all of your Ahyoheek points, you will become a Rank 0 player, and, although you will still be able to play Ahyoheek, you will not be able to bet any points at the table. This means that if you lose a game, you will essentially not lose any points, but neither will any of your opponents gain any from you.

Still, I would be careful about losing too many; it’ll be an awfully long venture to climb back up to that 100 points that you started with if you get too far down. –Isyldar

When do I become a Rank 2 player? Or, how many points do I need to get to different ranks?

In our experiments, we were able to determine that when you obtain your 201st point, you will be considered a Rank 2 player, and that at your 401st point, you will be a Rank 3 player.

Nadnerb has contributed this chart which lays out the first 10 or so ranks for Ahyoheek. (Refer to the comments in this text for the formula to determine higher ranks.)

Rank PointRange
0 0
1 1-200
2 201-400
3 401-700
4 701-1100
5 1101-1600
6 1601-2200
7 2201-2900
8 2901-3700
9 3701-4600

What do the different ranks mean?

If you are a rank 1 player, you bet 1 point per round. If you are a rank 2 player, you will bet 2 points per round, and so on. (So, it’s a better idea to compete against players of a higher rank than yourself, if you want to increase your rank quicker.)

Did you know that Ahyoheek tables can bank points?

Believe it or not, an Ahyoheek table can bank points, if a player gets up from the table after they’ve bet their point(s) and before the round has been won.

At the present time, we’re looking into some theories that we have in regards to Age resets returning points to a person, however, what we do know at the moment is that, if a table has stored points and everyone gets up from the table, someone sitting back down at the table will be attributed the stored points. (We are not sure at the moment if this is a random effect, or if there is a logic to it, but we’re looking it.)


  1. […] We’ve got some answers to some Ahyoheek questions that have been plaguing us players for a long time…check it out here […]

    Pingback by URU Exploration » New Ahyoheek Information! — May 27, 2007 @ 3:27 pm Cavern Time

  2. […] There was also some more work done on the Neighborhood’s Archival texts. Those questions about the Ahyoheek tables that we did answer, I documented; and I also spent a little time working on the Bahro stone notes. (Not a necessary task, I know, but good to have one’s own text at hand when it’s needed.) […]

    Pingback by URU Exploration » Heek Testing — May 27, 2007 @ 11:05 pm Cavern Time

  3. I’ve figured out the ranking system…
    It’s actually not an exponential progression as I first thought, but rather a geometric series.


    Edit: Incorporated chart into main text. –Isyldar


    A simple program to find a rank based on playerscore.

    rank = 1;
    hpts = 1;
    i = 1;
    while((hpts*100) < playerscore) { hpts += i++; rank++; } at the end, the value of rank is the rank. I have tested this little program against all of the exceedingly ridiculous data points I sent Robert yesterday, and it all checks out. :D

    Comment by Nadnerb — July 5, 2007 @ 10:19 pm Cavern Time

  4. More specifically, the rankings are based on the Lazy Caterer’s sequence multiplied by 100. :)

    Comment by Herohtar — July 6, 2007 @ 3:32 pm Cavern Time

  5. Yeah.. I read your email. ;) Good find. I’m not entirely sure it’s suited for practical use though, since it can’t account for rank 0, and the increment loop is simpler.

    Also, there was a slight goof in my original script up there, 0 points is in fact rank 0.

    rank = 0;
    pts = 0;
    hpts = 1;
    while(pts < playerscore) { rank++; hpts += rank; pts = hpts * 100; } pointsToNextRank = pts - playerscore; And about "practical use" it It is indeed faster to find the rank divisions, if you have a known rank. So.. suited to different uses. :)

    Comment by Nadnerb — July 6, 2007 @ 5:47 pm Cavern Time

  6. Since it appears that the other formula won’t get posted by itself, I give you the lazy caterer’s formula:

    rank = drank – 1;
    points = (((rank*rank+rank+ 2)/2)*100)+1;
    if(drank < 2) {points = drank;} "drank" refers to the "desired rank". The reason for the "if" at the end is that the formula returns 101 for ranks 0 and 1.

    Comment by Nadnerb — July 7, 2007 @ 10:30 am Cavern Time

  7. […] Prior to recent events, research into the Ahyoheek ranking progression had been severely limited simply by the rate at which one could accrue points […]

    [edited for length :) –Isyldar]

    Pingback by URU Exploration » An Obsession with Precision — July 9, 2007 @ 11:37 am Cavern Time

  8. Another formula to calculate minimum points required for a given rank:

    ((Sigma of N)+1)*100+1 = Rank N

    And one to calculate the maximum points for a given rank:

    ((Sigma of N)+1)*100 = Rank (N-1)

    Comment by Robert F. Caine — July 15, 2007 @ 11:53 am Cavern Time

  9. LOL at the pingback, Izy.. :D

    Comment by Nadnerb — July 15, 2007 @ 8:29 pm Cavern Time

Leave a comment

To prove you're a person (not a spam script), type the security word shown in the picture. Click on the picture to hear an audio file of the word.
Anti-spam image