_ __ ____ _____ _
/ \ [ | |_ \|_ _| (_)
/ _ \ | | .--./) .--. | \ | | __ _ .--..--.
/ ___ \ | | / /'`\;/ .'`\ \ | |\ \| | [ | [ `.-. .-. |
_/ / \ \_ | | \ \._//| \__. |_| |_\ |_ | | | | | | | |
|____| |____|[___].',__` '.__.'|_____|\____|[___][___||__||__]
( ( __))
by cusma
Nim is a very simple mathematical game of strategy for two players. With a lot of imagination let's name them Alice and Bob.
Just to be fair from the very beginning: Nim is a zero-sum game and has been "mathematically solved", this means that exists an "easily calculated" perfect strategy to determine which player will win and what winning moves are open to that player.
So if Alice is a computer, Bob better avoid betting on winning the game.
AlgoNim is a cryptographic version of Nim that runs on Algorand Layer 1, directly on the Pure Proof of Stake consensus protocol, so nobody can cheat. The game implementation takes advantage of all the features introduced in Algorand 2.0 protocol: Algorand Standard Assets (ASA), Atomic Transfers (AT) and Algorand Smart Contracts (ASC1) using Algorand Python SDK + PyTeal. PyTeal is a binding for TEAL, the stateless bytecode stack based language for ASC1, in this sense AlgoNim is a truly stateless game.
Through the seamless interaction between Algorand Python SDK and PyTeal, AlgoNim automatically writes and initializes a dedicated set of stateless TEAL ASC1s and ASAs for each match. The whole match set-up takes few seconds and costs about 0.008 ALGOS for transactions fees. AlgoNim accounts initialization and opt-in require minimum balances, so the Dealer needs 0.8 ALGO that can be refunded by slightly enhancing the TEAL ASCs1 making them more cost-efficient. Considerng that a new ASA + ASC1 architecture is generated for each match, this time/cost performance is quite impressive if compared to other blockchains.
AlgoNim is played entirely from the command line interface. Find other AlgoNim players: https://t.me/algonim
AlgoNim is based on Nim's "normal" single heap variant. Alice is the player who creates the match: she is the Dealer and sets up the game table. Bob is the Opponent.
Rules are trivial:
- The Dealer chooses a heap of N pieces to be palced on the game table for the match;
- The Dealer chooses the number M of pieces that can be removed at the most from the game table in each turn;
- Alice and Bob choose who moves first;
- On each turn each player removes at least 1 and at the most M pieces from the game table;
Who removes the last piece of the heap form the table wins the match!
Alice and Bob may choose betting some ALGOs for the match. Further implementations will accept AlgoNim ASA Score Points other then the betting reward for the matches, this will enable an AlgoNim global ranking too!