> For the complete documentation index, see [llms.txt](https://miulien.gitbook.io/bot/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://miulien.gitbook.io/bot/en/faq/research.md).

# Related Research (research)

A collection of **probability simulations, mathematical studies, and interactive Desmos graphs** related to Miulien's games and economy. Read the game guides for ordinary usage; this page explores the underlying modeling.

## ✊ RPS: Player Count vs. Match Length

**Question:** How many rounds does multiplayer rock–paper–scissors take before someone meets the winning threshold, at different player counts?

Assume **every participant, including Miulien, submits a move each round**, choosing rock, paper, or scissors independently with probability **1/3 each**. A Monte Carlo experiment simulates **100,000 matches for each participant count, 1,000,000 matches total**, checking the winning threshold after each completed scoring round.

| Human players | Total including Miulien | Average finishing round |
| ------------: | ----------------------: | ----------------------: |
|             1 |                       2 |                **8.30** |
|             2 |                       3 |                **8.63** |
|             3 |                       4 |                **8.76** |
|             4 |                       5 |                **8.87** |
|             5 |                       6 |                **8.97** |
|             6 |                       7 |                **9.02** |
|             7 |                       8 |                **9.07** |
|             8 |                       9 |                **9.13** |
|             9 |                      10 |                **9.16** |
|            10 |                      11 |                **9.19** |

### Why are the averages near ten rounds?

For **N total players**, each player compares their choice to **N−1 others**. Winning, tying, and losing each have probability 1/3, so expected points per comparison are **(2+1+0)/3 = 1**. Expected points per player per round are therefore **N−1**, and the target is **10(N−1)**. That implies roughly ten rounds based on the mean individual's progress. But a match ends as soon as **anyone** reaches the target, yielding simulated averages below ten.

**Important property: if all players choose a move each round, the match must end by round ten.**

Each pair of players earns **two points combined**, regardless of the result. Across N players there are **N(N−1)/2** pairs, so combined points per round equal **N(N−1)**. At the end of ten rounds, combined points equal **10N(N−1)**, precisely N times the individual threshold. At least one player must have reached the threshold.

> **Real-game limitation:** These findings assume uninterrupted participation. Missed moves or players withdrawing invalidate the guaranteed ten-round bound and can change the average.

See [Multiplayer RPS](/bot/en/economy-games/rps.md).

## ⛸️ Skating: Ice Base Values

**Topic:** Numerical design of ice rewards in Skating.

[📈 Open the Skating Ice Base Values chart in Desmos](https://www.desmos.com/calculator/zuhfu5wfpt?lang=zh-TW)

See [Skating](/bot/en/economy-games/skating.md).

## 🍮 Slot: Jackpots

**Topic:** Probability and mathematical modeling of the Slot jackpot system.

[📈 Open Slot Jackpot in Desmos](https://www.desmos.com/calculator/zis1tfty1w?lang=zh-TW)

See [Slots](/bot/en/economy-games/slot.md).

## 🛒 Shop: Trading and Profitability

**Topic:** Numerical analysis of shop trading and profit models.

[📈 Open Shop Profitability in Desmos](https://www.desmos.com/calculator/yzm4ziyutn?lang=zh-TW)

See [Shop](/bot/en/economy-games/shop.md).

> The Desmos charts are external interactive resources; experiment with parameters to understand the models. Research helps explain design decisions, but **actual rules and values follow the current Miulien release**.
