« home Browsing all comments (spoilers: on | off) (info: on | off) next 25
NanoMods 8	Fri 05 Sep 2025 01:35
<noname> (SPOILER) Added speedrun: 197 moves (old: 221).
Random Modding Level 3	Fri 05 Sep 2025 01:35
<noname> (SPOILER) Added speedrun: 441 moves (old: 471).
Random Modding Level	Fri 05 Sep 2025 01:35
<noname> (SPOILER) Added speedrun: 317 moves (old: 427).
Sliding Doors	Fri 05 Sep 2025 01:33
<noname> (SPOILER) Added speedrun: 88 moves (old: 96). Optimal.
Ten by Thirty-Five	Wed 27 Aug 2025 00:52
<noname> (SPOILER) Added speedrun: 251 moves (old: 253). Optimal.
107% Fat Free	Sun 18 May 2025 13:06
<noname> (SPOILER) Added speedrun: 168 moves (old: 170). Optimal.
Dalek to the Rescue!	Thu 01 May 2025 04:33
<noname> (SPOILER) Added speedrun: 59 moves (old: 69). Optimal.
Space Travel	Fri 17 Jan 2025 21:48
<noname> (SPOILER) Added speedrun: 338 moves (old: 413).
Sorry, Tom. I'll Do Better	Fri 17 Jan 2025 21:47
<noname> (SPOILER) Added speedrun: 415 moves (old: 443).
Anthro for Experts	Sun 22 Dec 2024 17:23
<noname> (SPOILER) Added speedrun: 65 moves (old: 90). Optimal.
Bob 17	Wed 18 Dec 2024 01:30
<noname> (SPOILER) Added speedrun: 195 moves (old: 197). Optimal.
Smile	Mon 04 Nov 2024 23:35
<noname> (SPOILER) Added speedrun: 92 moves (old: 94). Optimal.
Colorful Circle	Sun 29 Sep 2024 03:45
<noname> (SPOILER) Added speedrun: 146 moves (old: 159). Optimal.
Colorful Circle (v2)	Sun 29 Sep 2024 03:45
<noname> (SPOILER) Added speedrun: 158 moves (old: 162). Optimal.
Anthropocentrism	Sat 21 Sep 2024 12:38
<noname> (SPOILER) Added speedrun: 55 moves (old: 60). Optimal.
Zero-Eleven	Thu 19 Sep 2024 07:08
<noname> (SPOILER) Added speedrun: 64 moves (old: 76).
Letter Series: c	Thu 19 Sep 2024 07:07
<noname> (SPOILER) Added speedrun: 98 moves (old: 106). Optimal.
Japanese Escape!	Sun 25 Aug 2024 19:13
<noname> (SPOILER) Added speedrun: 697 moves (old: 709). By assuming that each red block is to be pushed at most once, I formulated this as an instance of the assymmetric traveling salesman problem, and used PySCIPOpt [1] to solve it optimally (under the assumption). In fact, I basically just imported the atsp.py file from the Examples and work from there. Note that PySCIPOpt is based on the SCIP Optimization Suite [2]. References [1] S. J. Maher, M. Miltenberger, J. P. Pedroso, D. Rehfeldt, R. Schwarz, and F. Serrano, 'PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite', in Mathematical Software - ICMS 2016, 2016, vol. 9725, pp. 301-307. [2] S. Bolusani et al, 'The SCIP Optimization Suite 9.0', Optimization Online, Feb. 2024.
Breathe some more	Wed 24 Jul 2024 10:47
<noname> (SPOILER) Added speedrun: 201 moves (old: 240). Optimal. <noname> (SPOILER) Added speedrun: 240 moves (old: 242).
Be on the Right Side III	Sat 11 May 2024 21:10
<noname> (SPOILER) Added solution "Optimal bot killed": Maybe interesting to future players. <noname> (SPOILER) Added speedrun: 74 moves (old: 86). Optimal. Turns out not too bad for my solver to solve unrestricted. <noname> (SPOILER) Added solution "Optimal without bot": Perhaps this would still be interesting for future players... <noname> (SPOILER) Added speedrun: 86 moves (old: 103). This should be optimal among those solutions which kill the hugbot. I was able to keep the number of positions small by the above assumption, since this implies that all the panels controling the path to exit are covered by some block at the end, which means that blocks can't be, say, at an edge or form a 4x4 pattern with the wall (with at least one of the block being grey). I don't know if it's possible to solve without all blocks on a panel at the end; the total number of possible configurations without restriction seems too large for my solver to handle in reasonable time, so I'm not going to have my solver attempt this until I can come up with some new idea for this part.
15th prime number	Mon 29 Apr 2024 17:56
<mark> (SPOILER) Added speedrun: 487 moves (old: 534). I always wanted to know if this way was possible.
« home Browsing all comments (spoilers: on | off) (info: on | off) next 25