Formal Specification
Candlemas Lantern Procession and Song Quest — Formal Specification
Luxembourg · singing-circle · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Liichten — AI-optimized specification
## General idea
A cooperative route-optimization and procedural performance game where a team of children navigates a neighborhood street graph to visit households, perform traditional song verses, and collect resources (treats and coins) within a dusk-to-curfew time horizon.
## Formal model
- **Abstraction taken:** The physical village is modeled as a connected graph where nodes represent residential doorsteps with stochastic treat inventories, and edges represent walking transit times.
- **Player/agent count:** A cooperative team of agents (, standard 2 to 4) acting as a single unit or independent sub-groups.
- **Turn model:** Discrete time-step model where each step represents a navigation or doorstep interaction action.
## Formal rules
R1. Setup: Street graph initialized with household nodes. Each household has a boolean state , an answer probability , and a reward bundle . Team starts at origin node at time . Maximum time budget time units.
R2. Movement: On step , the team chooses to move to adjacent node costing transit time .
R3. Doorstep interaction: At an unvisited node :
- Team executes `ring_doorbell()` costing 1 time unit.
- Household state resolves: with probability , resident opens door.
- If open, team executes `sing_härgottsblieschen()` (costing 2 time units), succeeds, collects reward , and sets .
- If closed (resident away/busy), node is marked visited with reward 0.
R4. Inventory aggregation: Total collected treats .
R5. Equal distribution: [gap-fill] Upon termination, total treats are divided equally: , with remainder allocated by a round of token drawing.
R6. Win condition: Cooperative score maximization — maximize within time budget .
## Edge cases
- Tie at the end condition: Not applicable — cooperative game evaluating collective resource total .
- A player with no legal move: Not applicable — team can always move to neighboring node or return to base .
- Repetition / cycles: Graph traversal allows revisiting nodes, but visited households yield no additional rewards; bounded strictly by .
- Simultaneous claims on the same resource or position: [gap-fill] If multiple sub-teams visit the same household node, the first arriving sub-team claims the reward bundle .
- Player elimination mid-round; turn order repair: If an agent drops out, the group size ; resource division at the end adapts to the remaining group.
- Resource exhaustion: Limited by the finite set of households and time limit .
- Termination guarantee: Provably terminates at step .
## State representation
- Persistent state: Graph topology , node states (visited, answer probability, reward distribution), current time .
- Per-team state: Current node position , collected resource total , lantern illumination status.
- Observable information: Fully observable map of street connections; household open probabilities and reward amounts are latent until doorstep arrival.
## Action space
- `move_to(neighbor_node)`: Traverse connected edge .
- `ring_doorbell()`: Initiate doorstep interaction at current node.
- `sing_song()`: Execute traditional vocal routine when door opens.
## Playability notes
- Single-player-vs-AI: Natural — 1 human player managing the route path and song timing in a festive time-management strategy challenge.
- Group games (n>4): Extends to competitive multi-team orienteering where multiple children's groups compete for limited neighborhood treats without visiting duplicate houses.
- Physical-skill games: Abstracted to time-costed discrete state actions.
- What is lost: The cold February evening air, the glowing paper lantern craft, and the warm smiles of elderly village neighbors.
## Implementation hints
Classic Traveling Salesperson / Orienteering Problem with stochastic rewards. First milestone: implement a 10-node grid graph with Poisson reward distribution and a 30-turn countdown clock.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Candlemas Lantern Procession and Song Quest (Luxembourg). (n.d.). Games of Countries. https://gamesofcountries.com/games/lu-luxembourg/liichten
@misc{gamesofcountries-lu-luxembourg-liichten,
title = {Candlemas Lantern Procession and Song Quest (Luxembourg)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/lu-luxembourg/liichten}
}