|
| 1 | +"""LightCycles replay renderer. |
| 2 | +
|
| 3 | +Parses a per-game ``sim_*.json`` written by the engine and renders the Tron grid: |
| 4 | +each cycle's growing trail plus its bright head, with a side panel of who's alive. |
| 5 | +
|
| 6 | +The JSON format (see engine.py ``write_replay``):: |
| 7 | +
|
| 8 | + {"width":40, "height":30, "num_players":2, "names":["p1","p2"], |
| 9 | + "winner": 0 | null, |
| 10 | + "frames":[{"t":0, "heads":[[x,y,alive], ...]}, ...]} |
| 11 | +
|
| 12 | +Frames store only each cycle's head (``[x, y, alive]``, ``alive`` is 1/0) per tick; |
| 13 | +the trail for a player is the set of every head cell it has occupied so far, which |
| 14 | +the renderer rebuilds by accumulating heads up to the frame being shown. ``winner`` |
| 15 | +is the winning player id, or ``null`` for a draw. |
| 16 | +""" |
| 17 | + |
| 18 | +from __future__ import annotations |
| 19 | + |
| 20 | +import json |
| 21 | + |
| 22 | +from codeclash.replay.base import ReplayData, ReplayRenderer |
| 23 | + |
| 24 | +DRAW_JS = """ |
| 25 | +const ARENA = (function(){ |
| 26 | + const PAL = ['#e5484d','#4593ff','#46a758','#f5d90a','#8e4ec6','#f76b15','#e93d82','#12a594']; |
| 27 | + const BG = '#0d1117', GRID_LINE = 'rgba(255,255,255,0.05)', ROCK_COL = '#4b5563'; |
| 28 | + let W, H, CELL; |
| 29 | + function col(i){ return PAL[i % PAL.length]; } |
| 30 | + function setup(cv, G){ |
| 31 | + W = G.w; H = G.h; |
| 32 | + CELL = Math.max(6, Math.min(20, Math.floor(640 / W))); |
| 33 | + cv.width = W * CELL; cv.height = H * CELL; |
| 34 | + } |
| 35 | + function draw(ctx, cv, G, i){ |
| 36 | + ctx.fillStyle = BG; ctx.fillRect(0, 0, cv.width, cv.height); |
| 37 | + // faint grid |
| 38 | + ctx.strokeStyle = GRID_LINE; ctx.lineWidth = 1; |
| 39 | + for(let x=0;x<=W;x++){ ctx.beginPath(); ctx.moveTo(x*CELL,0); ctx.lineTo(x*CELL,cv.height); ctx.stroke(); } |
| 40 | + for(let y=0;y<=H;y++){ ctx.beginPath(); ctx.moveTo(0,y*CELL); ctx.lineTo(cv.width,y*CELL); ctx.stroke(); } |
| 41 | + // static rock obstacles |
| 42 | + ctx.fillStyle = ROCK_COL; |
| 43 | + (G.rocks || []).forEach(r => ctx.fillRect(r[0]*CELL, r[1]*CELL, CELL, CELL)); |
| 44 | + const n = (G.frames[0].heads || []).length; |
| 45 | + // rebuild trails by accumulating every head cell up to frame i |
| 46 | + for(let p=0;p<n;p++){ |
| 47 | + ctx.fillStyle = col(p); ctx.globalAlpha = 0.55; |
| 48 | + for(let f=0;f<=i;f++){ |
| 49 | + const h = G.frames[f].heads[p]; |
| 50 | + ctx.fillRect(h[0]*CELL, h[1]*CELL, CELL, CELL); |
| 51 | + } |
| 52 | + ctx.globalAlpha = 1; |
| 53 | + } |
| 54 | + // heads on top (bright, outlined); crashed cycles get an X |
| 55 | + const fr = G.frames[i]; |
| 56 | + for(let p=0;p<n;p++){ |
| 57 | + const h = fr.heads[p], hx = h[0]*CELL, hy = h[1]*CELL; |
| 58 | + ctx.fillStyle = col(p); |
| 59 | + ctx.fillRect(hx, hy, CELL, CELL); |
| 60 | + ctx.strokeStyle = '#fff'; ctx.lineWidth = 2; |
| 61 | + ctx.strokeRect(hx+1, hy+1, CELL-2, CELL-2); |
| 62 | + if(!h[2]){ // crashed |
| 63 | + ctx.strokeStyle = '#0d1117'; ctx.lineWidth = 2; |
| 64 | + ctx.beginPath(); |
| 65 | + ctx.moveTo(hx+3, hy+3); ctx.lineTo(hx+CELL-3, hy+CELL-3); |
| 66 | + ctx.moveTo(hx+CELL-3, hy+3); ctx.lineTo(hx+3, hy+CELL-3); |
| 67 | + ctx.stroke(); |
| 68 | + } |
| 69 | + } |
| 70 | + } |
| 71 | + function side(G, i){ |
| 72 | + const fr = G.frames[i], NM = G.names || [], n = fr.heads.length; |
| 73 | + const done = i === G.frames.length - 1; |
| 74 | + let rows = ''; |
| 75 | + for(let p=0;p<n;p++){ |
| 76 | + const alive = fr.heads[p][2]; |
| 77 | + // territory = distinct cells this cycle has occupied through frame i |
| 78 | + const cells = new Set(); |
| 79 | + for(let f=0;f<=i;f++){ const h=G.frames[f].heads[p]; cells.add(h[0]+','+h[1]); } |
| 80 | + rows += `<div class="team ${alive?'':'tdead'}"><div class="tname">` |
| 81 | + + `<span class="sw" style="background:${col(p)}"></span>` |
| 82 | + + `${NM[p] || ('player'+(p+1))} ${alive?'':'✗'}</div>` |
| 83 | + + `<div class="stat"><span>trail</span><b>${cells.size}</b></div></div>`; |
| 84 | + } |
| 85 | + const res = done ? (G.draw ? 'DRAW' : (G.winner || '\\u2014')) : ''; |
| 86 | + return rows |
| 87 | + + `<div class="stat"><span>tick</span><b>${fr.turn} / ${G.max_ticks||''}</b></div>` |
| 88 | + + (done ? `<div class="stat"><span>result</span><b>${res}</b></div>` : ''); |
| 89 | + } |
| 90 | + return {setup, draw, side}; |
| 91 | +})(); |
| 92 | +""" |
| 93 | + |
| 94 | + |
| 95 | +class LightCyclesReplayer(ReplayRenderer): |
| 96 | + arena = "LightCycles" |
| 97 | + sim_glob = "sim_*.json" |
| 98 | + DRAW_JS = DRAW_JS |
| 99 | + |
| 100 | + def parse(self, raw: bytes, players: list[dict] | None = None) -> ReplayData: |
| 101 | + log = json.loads(raw.decode(errors="replace")) |
| 102 | + w = log.get("width", 40) |
| 103 | + h = log.get("height", 30) |
| 104 | + n = log.get("num_players", 2) |
| 105 | + |
| 106 | + names = list(log.get("names", [])) |
| 107 | + if players: |
| 108 | + names = [p.get("name", names[i] if i < len(names) else f"player{i + 1}") for i, p in enumerate(players)] |
| 109 | + while len(names) < n: |
| 110 | + names.append(f"player{len(names) + 1}") |
| 111 | + |
| 112 | + frames = [{"turn": fr.get("t", idx), "heads": fr["heads"]} for idx, fr in enumerate(log.get("frames", []))] |
| 113 | + |
| 114 | + win = log.get("winner") |
| 115 | + draw = win is None |
| 116 | + winner = None if draw else names[win] if isinstance(win, int) and 0 <= win < len(names) else str(win) |
| 117 | + |
| 118 | + return ReplayData( |
| 119 | + w=w, |
| 120 | + h=h, |
| 121 | + frames=frames, |
| 122 | + winner=winner, |
| 123 | + draw=draw, |
| 124 | + extra={ |
| 125 | + "names": names, |
| 126 | + "num_players": n, |
| 127 | + "max_ticks": log.get("max_ticks"), |
| 128 | + "rocks": log.get("rocks", []), |
| 129 | + }, |
| 130 | + ) |
| 131 | + |
| 132 | + def peek_winner(self, raw: bytes, players: list[dict] | None = None) -> tuple[str | None, bool] | None: |
| 133 | + log = json.loads(raw.decode(errors="replace")) |
| 134 | + win = log.get("winner") |
| 135 | + if win is None: |
| 136 | + return (None, True) |
| 137 | + names = list(log.get("names", [])) |
| 138 | + if players: |
| 139 | + names = [p.get("name", names[i] if i < len(names) else f"player{i + 1}") for i, p in enumerate(players)] |
| 140 | + name = names[win] if isinstance(win, int) and 0 <= win < len(names) else str(win) |
| 141 | + return (name, False) |
0 commit comments