Archery tournament design

Over the last couple of days, I switched on the TV in order to “jinx” two of India’s more promising archers in their respective games at the Olympics. On Monday evening, I switched on the TV to see R Banerjee (forget his first name) lose a close game in the round of 32. Yesterday, I watched Tarundeep Rai shoot well but still get well beaten by an absolutely in-form guy named Kim (from Korea, where else?). As I watched these matches, I was thinking about the nature of competition in archery.

Archery is a fundamentally single-player event. You are competing against yourself, and how well you do is not supposed to be affected by how well someone else does. There is no direct opponent you are playing against who tries to prevent you from scoring. In some ways, you can consider it to be similar to running. The only element of competition is the pressure that is exerted upon you be opponents competing simultaneously. In this context, it is indeed surprising that the archery event has been designed as a one-on-one knockout, like you would expect for a direct-opposition sport like tennis.

An event directly comparable to archery in terms of fundamentals is shooting – there again, there is no impact of one player on another’s performance but for the pressure exerted by means of simultaneous competition. Shooting, however, goes the “races” (running/swimming) way by means of having heats where only one’s absolute performance matters in terms of score matters (there is no limit on the number of the number of finalists from one heat; the best 8 or 10 participants across heats make it).

Then why is it that archery, which is fundamentally similar to these sports in terms of fundamental concepts, relies on head-to-head competition, and that too with no repechage? Yesterday, I watched Tarundeep Rai come up against an absolutely inspired Kim – Kim was in such imperious form that irrespective of how well Rai would have done he wouldn’t have qualified. Rai didn’t play badly, “against” any other opponent or on another day, he would have definitely done better. In a “direct combat” sport (such as tennis), one can point to the luck of the draw and similar matters. But in a distinctly non-combative sport such as archery why should artificial tournament standards be designed and that extra bit of luck be introduced?

I hope the archery administrators realize the stupidity of the curent format and move to one that is similar to what we see in shooting today.

The Film Game

So today I was introduced to this “hangout game” called Film Aata (the Film Game). The rules of this game are fairly simple. Through a slightly complicated process, you pick a random letter in the alphabet. Everyone is given a certain amount of time (we played with five minutes), and in that time you need to write down as many films as possible whose names start with that letter.

It’s a fairly simple and fun (though can’t be played for too long or too often given that the number of letters in the alphabet) but what makes it interesting is the scoring system. You get points for each UNIQUE movie whose name that you have written. So basically if you’ve written down the name of a movie which at least one other person has written down, you get no points for it. So apart from knowing the names of lots of movies you need to know movies that others don’t know (and it’s useful to have a resource such as IMDB handy).

So basically correlation matters! If there is one other player in the group who has similar tastes as yours, you are bound to get screwed. For example, the two people with whom I was playing this game today are sisters, so there was a major overlap in the names of the movies that they knew, which meant that on a relative scale I performed better than I would have considering the length of my total list.

I found the game extremely interesting! Now, here is a modification that would make the game more interesting. Put a cap on the total number of movie names that a player can write, all other rules staying the same. Currently, with no limits, you will end up writing names of all movies that you can think of. There is no strategy per se involved in the game. It’s more a test of memory.

However, once we put a cap, that brings in an element of strategy to the game. Now you will need to pick and choose the movies whose names you want to put down – to choose the movies that you know other people won’t know. And in case the cap is really low, then to pick and choose the movies whose names you know others won’t write. Insane game theory scope are there!

This also makes the game more repeatable – you can play it more often with different sets of people, and each time you’ll be trying to read the minds of different people and that will make things fun. With the same set of people, you can play with different caps, giving a new strategy each time.

It’s a simple game. A kids’ game. Something that might appear to be all too simplistic on the face of it, but this simplicity allows easy innovation, and that can make the game extremely fun!

P Polie Exclusion Principle

The basic concept is that for any given person, no two romantic partners fulfil the same kind of needs.

Let us take all the possible ways in which a romantic partner (since we are talking about multiple partners for the same person, usuallly happening at different points of time in the person’s life, I don’t want to use the term “long-term gene propagating partner”) can help you out. The kind of needs that she can fulfil. Make a list of them, and represent them as a vector.

And to this, add a vector of binaries. Let us call it the “need vector”. You might have guessed that an element of this vector is 1 if the partner fulfils this particular need and 0 otherwise. So for each of your romantic partners (spanning across space and time), construct such a vector. Yeah of course some of these needs are more important than others so you might think you might want to give weights, but that is not the purpose of this exercise.

The Pauli Exclusion Principle in quantum mechanics states that no two electrons can have the same four quantum numbers. Similarly the P Polie Exclusion Principle in romantic relationships states that no two of your romantic partners have the same need vector. That the needs vector of any two of your romantic partners have a hamming distance of at least 1.

This principle has certain important consequences. Given that any two of your romantic partners are separated by a Hamming distance of at least 1 and using the Neha Natalya-xkcd argument, the number of romantic partners you can possibly have in your lifetime is bounded from above by 2^n, where n is the length of your need vector. So contrary to intuition, this shows that promiscuous people actually have a larger set of needs from romantic partners than committed people.