This is my collection of all levels I have solved in the game Human Resource Machine.
I try to complete every level with the two extra conditions (one is a maximum runtime, the other a maximum size), and currently I have managed this in all levels.
| Level | Solved | Size constraint | Runtime constraint |
|---|---|---|---|
| 001 | Yes | 6 / 6 | 6 / 6 |
| 002 | Yes | 3 / 3 | 25 / 25 |
| 003 | Yes | 6 / 6 | 6 / 6 |
| 004 | Yes | 7 / 7 | 21 / 21 |
| 005 | story | story | story |
| 006 | Yes | 6 / 6 | 24 / 24 |
| 007 | Yes | 4 / 4 | 23 / 23 |
| 008 | Yes | 6 / 6 | 24 / 24 |
| 009 | Yes | 5 / 5 | 25 / 25 |
| 010 | Yes | 9 / 9 | 36 / 36 |
| 011 | Yes | 10 / 10 | 40 / 40 |
| 012 | Yes | 14 / 14 | 56 / 56 |
| 013 | Yes | 9 / 9 | 27 / 27 |
| 014 | Yes | 10 / 10 | 31 / 34 |
| 015 | story | story | story |
| 016 | Yes | 8 / 8 | 34 / 36 |
| 017 | Yes | 11 / 12 | 28 / 28 |
| 018 | story | story | story |
| 019 | Yes | 10 / 10 | 67 / 82 |
| 020 | Yes | 15 / 15 | 80 / 109 |
| 021 | Yes | 10 / 10 | 71 / 72 |
| 022 | Yes | 19 / 19 | 137 / 156 |
| 023 | Yes | 13 / 13 | 75 / 75 |
| 024 | Yes | 11 / 12 | 53 / 57 |
| 025 | Yes | 12 / 12 | 79 / 82 |
| 026 | Yes | 15 / 15 | 63 / 76 |
| 027 | story | story | story |
| 028 | Yes | 33 / 34 | 78 / 78 |
| 029 | Yes | 5 / 5 | 20 / 25 |
| 030 | Yes | 7 / 7 | 160 /203 |
| 031 | Yes | 10 / 11 | 96 /122 |
| 032 | Yes | 16 / 16 | 311 /393 ( 51/393 with tricks (^2) ) |
| 033 | story | story | story |
| 034 | Yes | 13 / 13 | 157 /323 |
| 035 | Yes | 16 / 17 | 74 /167 |
| 036 | Yes | 39 / 39 | 109 /111 |
| 037 | Yes | 8 / 8 | 36 / 36 |
| 038 | Yes | 38 / 38 | 132 /165 |
| 039 | Yes | 14 / 14 | 47 / 76 |
| 040 | Yes | 24 / 28 | 105 /399 |
| 041 | Yes | 34 / 34 | 670 /714 |
| 042 | story | story | story |
Note: There are sometimes levels with an solution for both conditions and an extra solution only for runtime. That's because, while the first meets both conditions, I found another algorithm to solve the level even faster (with the cost of increasing the operations count).
I highly recommend you to buy the game and play for yourself - only look here for solutions hints if you are genuinely(^1) stuck.
(^1) like stuck for multiple hours trying
(^2) In Level 32 I achieved a runtime of 52 by creating a map of the different occurrences at compile-time (B=5, C=2 ...) and then simply testing which letter comes from the INPUT. This only works as long as the floor stays the same between multiple runs. But it seems like it does :).