[{"_1":2,"_192":-5,"_193":-5},"loaderData",{"_3":4,"_61":62,"_191":-5},"root",{"_5":6,"_21":-5,"_22":-5,"_23":24,"_42":-5,"_43":-5,"_44":-5,"_45":46,"_47":48,"_57":58,"_59":60},"env",{"_7":8,"_9":10,"_11":12,"_13":14,"_15":16,"_17":18,"_19":20},"SUPABASE_URL","https://hello.websim.com","SUPABASE_KEY","sb_publishable_Psom5r5hvV9Glvzv4s3oOQ_2b_HevU-","POSTHOG_KEY","phc_VHMOlrdxAbgSZHeF0SdSf07LZLRLAg5pZuTHkJGn050","POSTHOG_API_HOST","https://e.wbsm.ai","POSTHOG_UI_HOST","https://app.posthog.com","GOOGLE_OAUTH_CLIENT_ID","891181648870-i708rj1bgjol84hie20shfr4u4ecf3o7.apps.googleusercontent.com","ACTIVITY_DIRECT_PAGEVIEW","on","authUser","user","snapshotData",{"_25":-5,"_26":-5,"_27":-5,"_28":-5,"_29":-5,"_30":-5,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":-5,"_36":-5,"_37":-5,"_38":-5,"_39":-5,"_40":-5,"_41":-5},"lastProjectId","sidebarTab","homepageTab","pinSidebar","settingsOpen","maximized","assetsExpanded","focusedAssetFilename","authError","authErrorCode","authErrorDescription","sidebarWidth","videoMuted","videoVolume","navigationContext","hasSeenFeedOnboarding","nextUpExpanded","plan","balances","rewards","loadedAt",1794680896581,"origins",{"_49":50,"_51":52,"_53":54,"_55":56},"origin","https://websim.com","apiOrigin","https://api.websim.com","contentOrigin","https://{PROJECT_ID}.c.websim.com","appDomainOrigin","https://{SUBDOMAIN}.on.websim.com","isMobile",false,"theme","auto","slug",{"_63":64,"_65":66,"_123":124,"_145":146,"_183":184,"_185":-5,"_186":187,"_188":189},"version","1","project",{"_67":65,"_68":69,"_70":71,"_72":73,"_83":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":-5,"_94":-5,"_95":-5,"_96":-5,"_97":98,"_99":100,"_61":109,"_110":98,"_111":98,"_112":58,"_113":114,"_115":116,"_117":-5,"_118":119,"_120":-5,"_121":-5,"_122":58},"_type","id","4f1x31dejuk42bt8kc0o","created_at","2026-06-08T23:37:57.703Z","created_by",{"_67":22,"_68":74,"_75":76,"_70":77,"_78":79,"_80":-5,"_81":-5,"_82":58},"2c6bd271-82d8-4ad5-9e9d-6e1a9ce7b23f","username","lomoe","2025-04-19T02:24:46.697Z","avatar_url","https://lh3.googleusercontent.com/a/ACg8ocJ1Th5afSyPCYDuLr5L_eW4Q_qwRSRJt2rXSSPwxzJf0EbAPA=s96-c","discord_username","discord_id","is_admin","updated_at","2026-06-29T02:41:38.779Z","title","Crawl2win Top100Hardest on websim","comments_mode","open","visibility","public","current_version",188,"last_posted_version","parent_id","parent_version","deleted_at","posted",true,"stats",{"_101":102,"_103":69,"_104":105,"_106":107,"_108":107},"~type","project_stats","project_id","views",23,"likes",1,"comments","2d-maze","auto_set_current","allow_automatic_improvements","board_enabled","description","This game is a 2d maze whit entitis in a maze where you have to fix items in the maze there are 8levels Good Luck","generated_description","Crawl2win Top100Hardest on websim — 2D maze game with WASD movement, 8 escalating levels, repair vents and items, smart cheat-AI pathfinding, speed modes (Half/Full cap), ghost replays showing best runs, leaderboards, account support, time & movement tracking.","from_template","domains",[],"thumbnail","video","has_active_experiment","project_revision",{"_67":123,"_68":125,"_63":92,"_70":126,"_127":-5,"_94":-5,"_128":129,"_130":69,"_72":131,"_132":133,"_103":69,"_83":134,"_96":-5,"_99":135,"_138":58,"_139":140,"_141":-5,"_142":-5,"_143":144},"019efbf8-ffbc-7644-9fb7-af9ad821fcfd","2026-06-24T23:31:00.156Z","visited_at","parent_revision_version",180,"parent_revision_project_id",{"_67":22,"_68":74,"_75":76,"_70":77,"_78":79,"_80":-5,"_81":-5,"_82":58},"meta",{"_63":64},"2026-06-24T23:32:02.990Z",{"_136":137},"multiplayer_count",0,"draft","site_id","zeHyzQMj67OHHPuFa","chat_session_id","chat_session_run_index","current_screenshot_url","https://project-screenshots.websim.com/019efbf9-d905-7057-8eb5-033ba507f5aa","site",{"_67":145,"_68":140,"_94":147,"_70":148,"_149":150,"_151":152,"_153":154,"_85":166,"_167":168,"_169":170,"_175":-5,"_176":177,"_178":179,"_96":-5,"_180":181,"_182":-5},"lmH817fc4FydgGuPD","2026-06-24T23:31:25.698Z","state","done","model","gpt-5-mini","lore",{"_63":107,"_155":156,"_157":58,"_158":58,"_159":98,"_160":58,"_161":98,"_162":58,"_163":58,"_164":58,"_165":58},"attachments",[],"enableMultiplayer_v2","enableMobilePrompt","enableLLM2","enableComments","enableVideo","enableApi","enableTweaks","enableDB","enableDB_v2_1","2D Maze","owner",{"_67":22,"_68":74,"_75":76,"_70":77,"_78":79,"_80":-5,"_81":-5,"_82":58},"prompt",{"_171":172,"_173":174},"type","plaintext","text","make it so after beating every night there is a ghost player showing youre record time movement","url","link_url","/p/4f1x31dejuk42bt8kc0o","versioned_link_url","/p/4f1x31dejuk42bt8kc0o/188","yapping","I will add per-level move-position recording, best-run storage, and a ghost-replay system that records your moves each night and plays a translucent \"ghost player\" showing your record movement when the level is loaded.\n\nmain (2).js\n```\n<<<<<<< SEARCH\n// per-level move timestamps (for average BPS calculation)\nconst moveTimesPerLevel = new Array(LEVELS.length).fill(null).map(()=>[]);\nconst averageBpsPerLevel = new Array(LEVELS.length).fill(null); // populated by local calc and later refined by AI\n=======\n// per-level move timestamps (for average BPS calculation)\nconst moveTimesPerLevel = new Array(LEVELS.length).fill(null).map(()=>[]);\nconst movePositionsPerLevel = new Array(LEVELS.length).fill(null).map(()=>[]); // record player positions per step\nconst averageBpsPerLevel = new Array(LEVELS.length).fill(null); // populated by local calc and later refined by AI\n// best run storage per level (keeps times and positions for ghost replay)\nconst bestRunsPerLevel = new Array(LEVELS.length).fill(null);\n>>>>>>> REPLACE\n```\n\nmain (2).js\n```\n<<<<<<< SEARCH\nfunction recordPlayerMove(ts = performance.now()){\n playerMoveTimes.push(ts);\n // also record per-level move timestamps for later average calculations\n if (typeof currentLevel === 'number' && currentLevel >= 0 && currentLevel < moveTimesPerLevel.length){\n moveTimesPerLevel[currentLevel].push(ts);\n }\n // drop old samples for immediate speed readout\n while(playerMoveTimes.length > 1 && (ts - playerMoveTimes[0]) > SPEED_SAMPLE_WINDOW_MS){\n playerMoveTimes.shift();\n }\n updateSpeedometer();\n}\n=======\nfunction recordPlayerMove(ts = performance.now()){\n playerMoveTimes.push(ts);\n // also record per-level move timestamps and positions for later average calculations and ghost replay\n if (typeof currentLevel === 'number' && currentLevel >= 0 && currentLevel < moveTimesPerLevel.length){\n moveTimesPerLevel[currentLevel].push(ts);\n // record current player tile snapshot\n movePositionsPerLevel[currentLevel].push({ x: player.x, y: player.y, t: ts });\n }\n // drop old samples for immediate speed readout\n while(playerMoveTimes.length > 1 && (ts - playerMoveTimes[0]) > SPEED_SAMPLE_WINDOW_MS){\n playerMoveTimes.shift();\n }\n updateSpeedometer();\n}\n>>>>>>> REPLACE\n```\n\nmain (2).js\n```\n<<<<<<< SEARCH\n // when leaving a previous level, accumulate elapsed time\n if (typeof levelStartTs === 'number' && levelStartTs > 0 && currentLevel >=0 && currentLevel < LEVELS.length){\n timeMsPerLevel[currentLevel] += Math.max(0, performance.now() - levelStartTs);\n // compute a local average BPS immediately for the level we just finished\n try { computeLocalAverageBPS(currentLevel); } catch(e){ console.warn('local avg bps error', e); }\n // kick off an AI-backed refinement of the average BPS (async)\n try { aiComputeAverageBPS(currentLevel); } catch(e){ console.warn('ai avg bps kickoff error', e); }\n }\n=======\n // when leaving a previous level, accumulate elapsed time and consider saving a best run for ghost replay\n if (typeof levelStartTs === 'number' && levelStartTs > 0 && currentLevel >=0 && currentLevel < LEVELS.length){\n const elapsed = Math.max(0, performance.now() - levelStartTs);\n timeMsPerLevel[currentLevel] += elapsed;\n // compute a local average BPS immediately for the level we just finished\n try { computeLocalAverageBPS(currentLevel); } catch(e){ console.warn('local avg bps error', e); }\n // kick off an AI-backed refinement of the average BPS (async)\n try { aiComputeAverageBPS(currentLevel); } catch(e){ console.warn('ai avg bps kickoff error', e); }\n\n // Save best run (shorter total time) using recorded positions/timestamps for this level.\n try {\n const runPositions = (movePositionsPerLevel[currentLevel] || []).slice();\n if (runPositions.length >= 2){\n // normalize times to deltas from first step\n const t0 = runPositions[0].t;\n const times = runPositions.map(p => Math.round(p.t - t0));\n const positions = runPositions.map(p => ({x:p.x,y:p.y}));\n const runDuration = elapsed;\n const prev = bestRunsPerLevel[currentLevel];\n // store if no previous or faster run found\n if (!prev || runDuration < prev.duration){\n bestRunsPerLevel[currentLevel] = { duration: runDuration, times, positions };\n }\n }\n } catch(e){\n console.warn('saving best run failed', e);\n }\n }\n>>>>>>> REPLACE\n```\n\nmain (2).js\n```\n<<<<<<< SEARCH\nfunction computeLocalAverageBPS(levelIdx){\n if (typeof levelIdx !== 'number' || levelIdx < 0 || levelIdx >= moveTimesPerLevel.length) return null;\n const arr = moveTimesPerLevel[levelIdx] || [];\n if (!arr || arr.length < 2) {\n averageBpsPerLevel[levelIdx] = 0;\n return 0;\n }\n const first = arr[0];\n const last = arr[arr.length-1];\n const moves = arr.length - 1;\n const spanSec = Math.max(0.001, (last - first) / 1000);\n const bps = moves / spanSec;\n averageBpsPerLevel[levelIdx] = bps;\n // update UI\n try { updateAvgDisplay(); } catch(e){}\n return bps;\n}\n=======\nfunction computeLocalAverageBPS(levelIdx){\n if (typeof levelIdx !== 'number' || levelIdx < 0 || levelIdx >= moveTimesPerLevel.length) return null;\n const arr = moveTimesPerLevel[levelIdx] || [];\n if (!arr || arr.length < 2) {\n averageBpsPerLevel[levelIdx] = 0;\n return 0;\n }\n const first = arr[0];\n const last = arr[arr.length-1];\n const moves = arr.length - 1;\n const spanSec = Math.max(0.001, (last - first) / 1000);\n const bps = moves / spanSec;\n averageBpsPerLevel[levelIdx] = bps;\n // update UI\n try { updateAvgDisplay(); } catch(e){}\n return bps;\n}\n\n// --- Ghost replay system: draw a translucent ghost that replays the best run for the current level ---\nconst ghost = { playing:false, positions:[], times:[], startTs:0, index:0 };\n\nfunction startGhostForLevel(levelIdx){\n const best = bestRunsPerLevel[levelIdx];\n if (!best || !best.positions || best.positions.length < 1) {\n ghost.playing = false;\n return;\n }\n ghost.positions = best.positions.slice();\n ghost.times = best.times.slice();\n ghost.startTs = performance.now();\n ghost.index = 0;\n ghost.playing = true;\n}\n\nfunction renderGhost(){\n if (!ghost.playing || !ghost.positions || ghost.positions.length === 0) return;\n const elapsed = performance.now() - ghost.startTs;\n // find latest index where time <= elapsed\n while (ghost.index + 1 < ghost.times.length && ghost.times[ghost.index + 1] <= elapsed){\n ghost.index++;\n }\n // if finished, stop\n if (ghost.index >= ghost.positions.length - 1 && elapsed > (ghost.times[ghost.times.length - 1] + 250)){\n ghost.playing = false;\n return;\n }\n const pos = ghost.positions[Math.min(ghost.index, ghost.positions.length-1)];\n // draw semi-transparent ghost square slightly offset so it stands out\n const pad = Math.max(2, Math.floor(cellSize * 0.16));\n const gx = pos.x * cellSize + pad;\n const gy = pos.y * cellSize + pad;\n const gsize = cellSize - pad*2;\n ctx.fillStyle = 'rgba(60,160,255,0.55)';\n ctx.fillRect(gx, gy, gsize, gsize);\n // outline\n ctx.strokeStyle = 'rgba(10,80,160,0.9)';\n ctx.lineWidth = Math.max(1, Math.floor(cellSize * 0.06));\n ctx.strokeRect(gx + 0.5, gy + 0.5, gsize - 1, gsize - 1);\n}\n>>>>>>> REPLACE\n```\n\nSummary: I added per-level position recording and best-run storage, saved faster runs on level completion, and implemented a ghostReplay (blue translucent player) that replays your best recorded movement when a level is loaded so you can see your record path.","page_description","cursor","eyJpZCI6IjRmMXgzMWRlanVrNDJidDhrYzBvIn0","token","included",[],"about",{"_190":-5},"parent","routes/browser/layout","actionData","errors"]