Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat(examples): a shifumi (rock, paper, scissors) smart contract #2629

Merged
merged 7 commits into from
Aug 30, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 7 additions & 0 deletions examples/gno.land/r/demo/games/shifumi/gno.mod
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
module gno.land/r/demo/games/shifumi

require (
gno.land/p/demo/avl v0.0.0-latest
gno.land/p/demo/seqid v0.0.0-latest
gno.land/r/demo/users v0.0.0-latest
)
120 changes: 120 additions & 0 deletions examples/gno.land/r/demo/games/shifumi/shifumi.gno
Original file line number Diff line number Diff line change
@@ -0,0 +1,120 @@
package shifumi

import (
"errors"
"std"
"strconv"

"gno.land/p/demo/avl"
"gno.land/p/demo/seqid"

"gno.land/r/demo/users"
)

const (
empty = iota
rock
paper
scissors
last
)

type game struct {
player1, player2 std.Address // shifumi is a 2 players game
move1, move2 int // can be empty, rock, paper, or scissors
}

var games avl.Tree
var id seqid.ID

func (g *game) play(player std.Address, move int) error {
if !(move > empty && move < last) {
return errors.New("invalid move")
}
if player != g.player1 && player != g.player2 {
return errors.New("invalid player")
}
if player == g.player1 && g.move1 == empty {
g.move1 = move
return nil
}
if player == g.player2 && g.move2 == empty {
g.move2 = move
return nil
}
return errors.New("already played")
}

func (g *game) winner() int {
if g.move1 == empty || g.move2 == empty {
return -1
}
if g.move1 == g.move2 {
return 0
}
if g.move1 == rock && g.move2 == scissors ||
g.move1 == paper && g.move2 == rock ||
g.move1 == scissors && g.move2 == paper {
return 1
}
return 2
}

// NewGame creates a new game where player1 is the caller and player2 the argument.
// A new game index is returned.
func NewGame(player std.Address) int {
games.Set(id.Next().String(), &game{player1: std.PrevRealm().Addr(), player2: player})
return int(id)
}

// Play executes a move for the game at index idx, where move can be:
// 1 (rock), 2 (paper), 3 (scissors).
func Play(idx, move int) {
v, ok := games.Get(seqid.ID(idx).String())
if !ok {
panic("game not found")
}
if err := v.(*game).play(std.PrevRealm().Addr(), move); err != nil {
panic(err)
}
}

func Render(path string) string {
mov1 := []string{"", " 🤜 ", " 🫱 ", " 👉 "}
mov2 := []string{"", " 🤛 ", " 🫲 ", " 👈 "}
win := []string{"pending", "draw", "player1", "player2"}

output := `# 👊 ✋ ✌️ Shifumi
Actions:
* [NewGame](shifumi?help&__func=NewGame) opponentAddress
* [Play](shifumi?help&__func=Play) gameIndex move (1=rock, 2=paper, 3=scissors)

game | player1 | | player2 | | win
--- | --- | --- | --- | --- | ---
`
// Output the 100 most recent games.
maxGames := 100
for n := int(id); n > 0 && int(id)-n < maxGames; n-- {
v, ok := games.Get(seqid.ID(n).String())
if !ok {
continue
}
g := v.(*game)
output += strconv.Itoa(n) + " | " +
shortName(g.player1) + " | " + mov1[g.move1] + " | " +
shortName(g.player2) + " | " + mov2[g.move2] + " | " +
win[g.winner()+1] + "\n"
}
return output
}

func shortName(addr std.Address) string {
user := users.GetUserByAddress(addr)
if user != nil {
return user.Name
}
if len(addr) < 10 {
return string(addr)
}
return string(addr)[:10] + "..."
}
Loading