Abstract: Amidakuji is a lottery game that randomly assigns n persons to n objects. It is a game more well known in China, Korea and Japan, as a way to make decision in a seemingly random way. The game consists of verticle paths from n starting points to n objects and rungs are randomly placed between two paths. Each player traces along a path and crossing over rungs to the end of their route to their unique assigned object. Mathematically speaking the game is a function assigning n objects to n persons. Since each object is being uniquely assigned to each person, this function in fact a permutation. This talk will discuss some of the mathematical aspects of Amidakuji and reprove some very well known theorems about permutations in this context.