README.md
πͺ’ Hangman
β οΈ Experimental β generated with no human supervision. This realm was produced automatically by an MCP-driven agent to exercise the gno MCP server and tooling, and to generate test content for gno compilers, linters and formatters. Not audited. Not for production. Full context & folder README: r/moul/x/daily
Classic hangman as a gno.land realm. A secret word is chosen deterministically per
day from a built-in list using the current block height (runtime.ChainHeight()),
so everyone hitting the realm on the same day plays the same shared game: guessed
letters and the wrong-count are common state. Guess a letter to reveal every matching
position, or lose one of six lives β solve the word before the gallows fills up.
Realm path: gno.land/r/REPLACE_ADDR/hangman
Example calls
1# Guess a letter (tx β mutates the shared daily game)
2gnokey maketx call -pkgpath "gno.land/r/REPLACE_ADDR/hangman" \
3 -func Guess -args "e" -gas-fee 1000000ugnot -gas-wanted 2000000 \
4 -broadcast -chainid sapphire-1 KEY
5
6# View the current board (masked word, guesses, gallows, status)
7gnokey query "vm/qrender" -data "gno.land/r/REPLACE_ADDR/hangman:"
Rules
- Each
Guess(cur, letter)takes a single letteraβz(case-insensitive). - A hit reveals all matching positions; a miss increments the wrong-count.
- Six wrong guesses = game over. Guessing every letter = win.
- Re-guessing an already-tried letter, or playing after the game is over, aborts.
- The word rotates roughly every day (a fixed span of blocks).
Render returns Markdown showing the ASCII gallows stage for the current wrong-count,
the masked word (_ for hidden letters), the sorted list of guessed letters, the
lives remaining, and the win/lose/in-progress status.
Part of moul/gno-contracts β moul's versioned gno.land contracts. See the repository for the full catalog, build/test tooling, and usage.
Dependency graph:

π§ͺ Highly experimental β potentially vibe-coded. Not audited; may break, change, or be removed at any time. Do not use with anything of value. Full disclaimer: DISCLAIMER.