{"weekOf":"2026-11-02","nextPuzzleAt":1794182400000,"puzzle":{"id":"three-player-redraw","title":"Three-Way Redraw","prompt":"Three players each privately draw a number uniformly from [0,1]. Seeing only their own number, each may discard it once and draw a replacement, which must be kept. All decisions are simultaneous and secret, and the highest final number wins. In the symmetric Nash equilibrium, every player redraws exactly when their first number is below a threshold t. Find t.","hint":"","solvers":0}}