AI-friendly board game rules summaries — use with Claude, ChatGPT, or any AI assistant
A memory and deduction game for 2-4 players set in ancient Egypt. Players search for treasures hidden beneath pyramids. On each turn, a search card reveals which treasure to find. Players move pyramids to reveal what is hidden underneath, trying to remember where treasures are located. The player who collects the most valuable search cards wins.
| Component | Quantity |
|---|---|
| Game board | 1 |
| Pyramids (covering treasures) | 30 |
| Treasure tokens (hidden under pyramids) | 30 |
| Search cards | Multiple |
| Rules booklet | 1 |
When a search card is revealed, the active player may move a pyramid to peek underneath. Movement rules limit how pyramids can be shifted. If the treasure matches the search card, the player claims the card. Players must remember the positions of treasures they’ve previously seen.
Pyramids slide along rows or columns. When a pyramid is moved, it displaces other pyramids in the row. This means the board configuration changes each turn, adding a spatial memory challenge on top of the content memory.
The game ends when the last search card has been won. Each player adds up the point values on their collected search cards. The player with the most points wins.
| Action | Description |
|---|---|
| Reveal card | Shows which treasure to find |
| Move pyramid | Slide along row/column to reveal |
| Claim card | If treasure matches, take the card |
| Win condition | Most points from collected search cards |