1 Commits

Author SHA1 Message Date
cade17a9a6 initial implementation 2021-07-19 11:09:08 -07:00
2 changed files with 61 additions and 17 deletions

52
fastrand.nim Normal file
View File

@ -0,0 +1,52 @@
import random, math
import times, std/monotimes, strformat, strutils
proc formatNum(n: SomeNumber): string =
let s = $(n.round)
let t = s[0 .. s.len - 3]
var count = 1
for i in countdown(t.high, 0):
result.insert($t[i], 0)
if count mod 3 == 0 and i != 0:
result.insert(",", 0)
count += 1
proc formatRate(n: Natural, d: Duration): string =
result = formatNum(1_000_000'f64 * n.float64 / d.inMicroseconds.float64)
proc fastRand(r: var Rand, x: Natural): uint64 =
# return ((r.next shr 32) * x.uint64) shr 32
let x = x.uint64
if x <= (uint64.high shl 32):
return ((r.next shr 32) * x.uint64) shr 32
else:
return r.next mod x.uint64
proc testFastRand(num = 1_000_000_000): Duration =
var r = initRand(rand(int64))
let start = getMonoTime()
for i in 1 .. num:
discard r.fastRand(5)
result = getMonoTime() - start
# echo "fastrand execution rate: ", 1000 * num / dur.inMilliseconds.int, " generated per second."
proc testStdRand(num = 1_000_000_000): Duration =
var r = initRand(rand(int64))
let start = getMonoTime()
for i in 1 .. num:
discard r.rand(4)
result = getMonoTime() - start
# echo "std rand execution rate: ", 1000 * num / dur.inMilliseconds.int, " generated per second."
randomize()
let runs = 100_000_000
let fr = testFastRand(runs)
echo "fastrand execution rate: ", formatNum(1_000_000 * runs / fr.inMicroseconds.int)
let sr = testStdRand(runs)
echo "standard execution rate: ", formatNum(1_000_000 * runs / sr.inMicroseconds.int)

View File

@ -53,13 +53,9 @@ type
camels*: ColorStack
tile*: Option[Tile]
CamelPos* = object
square*: range[1..16]
stackIdx*: int8
Board* = object
squares*: array[1..16, Square]
camels*: array[Color, CamelPos]
camels*: array[Color, range[1..16]]
diceRolled*: array[Color, bool]
leader*: Option[Color]
gameOver*: bool
@ -107,17 +103,13 @@ proc setState*(b: var Board;
tiles: openArray[tuple[t: Tile, p: int]]) =
for (color, dest) in camels: # note that `camels` is ordered, as this determines stacking
b[dest].camels.add(color)
let height = b[dest].camels.high
b.camels[color] = CamelPos(square: dest, stackIdx: height)
b.camels[color] = dest
for (tile, dest) in tiles:
b[dest].tile = some(tile)
for sq in b.squares:
if sq.camels.len > 0:
let squareLeader = sq.camels[^1]
if b.leader.isNone or b.leader.get != squareLeader:
b.leader = some(squareLeader)
let leadCamel = b[max(b.camels)].camels[^1] # top camel in the last currently-occupied space
b.leader = some(leadCamel)
proc diceRemaining*(b: Board): ColorStack =
@ -134,7 +126,7 @@ proc resetDice*(b: var Board) =
proc advance*(b: var Board, die: Die) =
let
(color, roll) = die
startPos = b.camels[color].square
startPos = b.camels[color]
var endPos = startPos + roll
if endPos > 16: # camel has passed the finish line
@ -152,18 +144,18 @@ proc advance*(b: var Board, die: Die) =
if prepend:
b[startPos].camels.moveSubstackPre(b[endPos].camels, stackStart)
let stackLen = b[startPos].camels.len - stackStart
for i in 0'i8 ..< stackLen:
for i in 0 ..< stackLen:
# we know how many camels we added to the bottom, so set the position for each of those
b.camels[b[endPos].camels[i]] = CamelPos(square: endPos, stackIdx: i) # replace with cast later?
b.camels[b[endPos].camels[i]] = endPos
else:
let dstPrevHigh = b[endPos].camels.high
b[startPos].camels.moveSubstack(b[endPos].camels, stackStart)
# the camels that have moved start immediately after the previous high camel
for i in (dstPrevHigh + 1) .. b[endPos].camels.high:
b.camels[b[endPos].camels[i]] = CamelPos(square: endPos, stackIdx: i)
b.camels[b[endPos].camels[i]] = endPos
# if we are stacking on or moving past the previous leader
if endPos >= b.camels[b.leader.get].square:
if endPos >= b.camels[b.leader.get]:
b.leader = some(b[endPos].camels[^1])
b.diceRolled[color] = true