Mines Algorithm Explained: How the RNG Places the Mines
How does Mines by Spribe decide where the mines are hidden? It is one of the most common questions players ask, and the answer matters because it explains what a player can and cannot influence. This guide covers how the board is generated, how the provably fair system works, and the exact math behind every payout. View live results at minesstats.com.
The Game in Brief
Mines is part of Spribe's Turbo Games line and is widely listed as released in 2021. The game uses a 5x5 grid of 25 tiles. Before each round you choose a stake and a number of mines between 1 and 24. You then reveal tiles one at a time. Every safe tile (a star) raises the payout, and you may cash out after any safe pick. If you reveal a mine, the stake is lost. When the round ends, every mine position is shown.
Each game is single-player. There is no shared round, no countdown and no other players on your board. A round lasts exactly as long as you keep clicking.
How the Mine Positions Are Generated
The key fact about the Mines algorithm is simple: the mine positions are fixed before your first click. The process looks like this:
Step 1: Server seed. The game server generates a random server seed for the round.
Step 2: Commitment. Spribe publishes a hash of that server seed before the round. This commits the server to the seed without revealing it, so the seed cannot be swapped once you start playing.
Step 3: Client seed(s). One or more client seeds are combined with the server seed, so the server is not the only source of input.
Step 4: Board derivation. The combined seeds are run through a SHA-512 hash, and the result determines where the mines sit on the grid.
Spribe does not publish further detail, such as the exact mapping from hash bytes to tiles, so this article does not claim any. What matters for players is the outcome: the board is decided up front, and your clicks only reveal what is already there.
The Math Behind Every Payout
Because the board is fixed and every arrangement is equally likely, the odds depend only on two numbers: the mines you chose (n) and the safe picks you have made (k).
Survival chance = C(25 - n, k) / C(25, k)
Payout = 0.97 x C(25, k) / C(25 - n, k), rounded down to two decimals and capped at 10,000x the stake.
The payout is simply the inverse of the survival chance multiplied by 0.97. That 0.97 factor is the 3% house edge, and it is the same for every mine count and every number of picks. Some reference values:
| Mines | Picks | Survival | Payout |
|---|---|---|---|
| 1 | 1 | 96.0% | 1.01x |
| 1 | 5 | 80.0% | 1.21x |
| 3 | 3 | 67.0% | 1.44x |
| 3 | 5 | 49.6% | 1.95x |
| 5 | 5 | 29.2% | 3.32x |
| 10 | 3 | 19.8% | 4.90x |
| 24 | 1 | 4.0% | 24.25x |
Multiply survival by payout in any row and you land at about 0.97. Choosing more mines or more picks changes variance, meaning how often you win and how large the wins are, but not the expected value. The RTP stays at 97% across the board.
Why the Algorithm Cannot Be Predicted
One-way hashing. Seeing the published hash does not reveal the server seed. Recovering the input from a cryptographic hash is computationally infeasible.
Independent rounds. Each round uses its own seeds. A past board tells you nothing about the next one, and there are no cycles or sequences to follow.
No memory. The algorithm does not track your wins or losses and does not adjust future boards based on them.
Tile choice does not matter. Since every arrangement of mines is equally likely, corners, edges, the centre and any clicking order all carry the same odds. A "safe corner" does not exist.
Provably Fair: How to Verify a Round
The provably fair system lets you confirm a round was not altered after it started:
- Before the round, the hash of the server seed is published.
- You play normally. The board is already decided.
- After the round, open the game history and use the verification icon on that round.
- The verification shows the seeds used, and you can check that the revealed server seed matches the hash published in advance.
If the values match, the mine positions were set before you placed your stake and were not changed while you played.
Common Algorithm Misconceptions
"The game moves mines after I click." False. The positions are committed through the hash before the first click.
"After several losses, a win is due." False. This is the Gambler's Fallacy. Each board is independent.
"Software can predict where the mines are." False. Any tool claiming to predict mine positions is a scam.
"Some mine counts have a better RTP." False. The 0.97 factor applies to every combination. Only variance changes.
Technical Summary
The Mines algorithm combines a committed server seed, client seeds and SHA-512 hashing to fix the board before play begins, while the payout formula builds a constant 3% house edge into every possible choice. Understanding this helps you approach the game with realistic expectations and avoid prediction scams.
Track live Mines results at minesstats.com.
Mines の分析ツールをご利用ください
当サイトのライブ統計、分布分析、トレンドチャート、provably fair 検証ツールで Mines のデータを分析できます。すべてのツールは無料で、登録は不要です。
関連ガイド
ゲームガイド:
戦略と分析:
詐欺に関する警告:
プラットフォームガイド:
Disclaimer: This article explains the mathematical and technical foundations of Mines for educational purposes only. Understanding the algorithm does not provide any advantage in predicting where the mines are. The house edge of 3% is permanent and unavoidable. Gamble responsibly.