c175353

位階：

上將

獎盃：

1083TOP 441

最短耗時：

效率：

經驗值：

491

裝備：

百局勝率：

連勝：

競技場積分：

最高難度：

百場競速：

賽季 S130：

717 1534

資源：

1.6M

2.4K

交易

關於我：

===== Playstyle ===== I enjoy playing high-difficulty boards and endgame puzzles. I play smaller high-difficulty boards because: (1) they are fast and fit into short breaks between work, (2) I can learn how to make better guesses much faster, and (3) if I make one fatal misclick every 2000 clicks, I can never clear 100x100 while this only mildly affects 20x20. ===== Stat weights, equipments, and talents ===== Here's a spreadsheet I made to help optimize equipment and talent strategy (e.g., stat weights, talent values, perfect upgrade priorities, and custom talents): https://docs.google.com/spreadsheets/d/18GnDZFkkJUuRnZZs6B4nbkz4bU-JwkkHjIY-pzzEqkA/ WoM rewards are virtual, and touching grass is almost certainly a better use of time. But if you are going to grind anyway, you might as well analyze your stats and make data-driven decisions. ===== EMC painting ===== My EMC painting shows an OR gadget used in [1]'s proof that Minesweeper is NP-complete. It is not the smallest known OR gadget, but it is the first one I learned, from [2]. [1] R. Kaye. Minesweeper is NP-complete. The Mathematical Intelligencer 22(2):9–15, 2000. [2] E. Demaine. 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs. MIT OpenCourseWare. Fall 2014. ===== My luckiest moments ===== https://minesweeper.online/new-game?g=6388625213 https://minesweeper.online/new-game?g=5047575267 https://minesweeper.online/new-game?g=6551101455 https://minesweeper.online/new-game?m=4976516035 世界很大，有多少日夜独往

最佳成績

總勝場

初級：

4 535

中級：

4 945

高級：

1 699

自訂：

—

3 541

簡單：

中等：

207

困難：

147

地獄：

190

自訂：

—

587

PvP：

732

總價：

16 597