Marvellous Inc.

Marvellous Inc.

Not enough ratings
Marvellous Inc. - Solutions + 100% Achievements
By Hanni
Guidance for completing the game and obtaining 100% achievements!
   
Award
Favorite
Favorited
Unfavorite
Introduction


Marvellous Inc. is an ASM-like programming game featuring 55 levels and 19 achievements. Most achievements are story-related or can be done at any time. Only one achievement is missable.

Notes
  • You'll receive tasks via email. Open an email, scroll down and click on 'reply' to start a level.
  • Sometimes, you have to wait for a few seconds to receive an email.
  • Never delete emails and always reply if possible!
  • Choices after puzzles are irrelevant.
  • The tasks and solutions are clustered regarding their clients. Press 'Ctrl' + 'F' to search.
  • You can paste code into the in-game editor with 'Ctrl' + 'V'.
  • You can replay all levels at any time.
Achievements
⋗︎ Story

Baby Robot Steps
Finish your first puzzle


Golden Star
Complete the tutorial


Party Boy
Attend Paul's houseparty


Senior Employee
Complete act 1


Zero to AI Hero
Complete every puzzle in the MarvGPT DLC
Note: MarvGPT DLC required.

The Price of Progress
Complete act 2


EOF
Complete the main game





⋗︎ Levels and Challenges

I Got You Bro
Complete puzzle 'Simple Sort'


Home Decor
Complete puzzle 'Home Improvement'


Lord Commander of the Division's Watch
Complete challenge puzzle 'Small Division'


Master of Optimization
Complete challenge puzzle 'Division II'


Sorting Doctor
Complete challenge puzzle 'Hardester Sort'





⋗︎ Endings

Better Years to Come...
Send proof from the inside


A New Dawn
Burn the evidence



The game features two endings which depend on the solution of the final level (can be replayed).



⋗︎ Deaths

I, Dead Robot
Take an innocent robot's life away


Spilling Oil
Kill 10 robots


Mechanical Genocide
Brutally murder 100 robots



Just replay any level and use:

walk



⋗︎ Random

One of a Kind
Receive a most peculiar robot



Play with bot 'Tammy'. You'll get a random bot at the beginning of each level / after failing it.



⋗︎ Missable

Best Programmer in the World
Complete every puzzle in the game. Congratulations!



Reply to the 'This is your oportunity' email to unlock the 'Decryptor' level - do not delete it.
Automated Introduction System
Hello World
walk west walk north walk east

Going all the way is not always good
walk 5 north walk east

Changing Perspective
walk east walk north walk 7 east turn north

DO YOU EVEN LIFT?
run: walk north walk south jmp run

Basic Firefighting
walk north pickup drop east walk east pickup walk drop south walk west pickup walk east walk 1 south drop walk walk west

Basic Programming
walk north walk east add: add [0] 1 0 write [0] jmp add

Sequence Separator
loop: walk south read 0 jlt [0] 0 blue walk east write [0] walk 5 west jmp loop blue: walk west write [0] walk 5 east jmp loop

Squaring
walk 7 west walk 3 north loop: read 0 west mov [0] 1 calculate: add [1] [2] 2 jeq [0] 0 output sub [0] 1 0 jgt [0] 0 calculate output: walk east write [2] walk west mov 0 1 mov 0 2 jmp loop
Fergus Gerhard Jacobsen
Bucket Mover
bucket: walk east pickup walk 11 west drop jmp bucket

Advanced Bucket Mover
walk east walk south walk east walk north walk east walk south walk east walk north walk west walk 10 south walk 1 east pickup north walk 1 south drop walk 1 east walk 1 north pickup walk 1 south drop walk 1 east walk 1 north pickup walk 1 south drop walk west walk south walk 2 east walk 1 north walk 3 east walk 1 south walk 1 east walk 1 south walk 3 east walk 7 north walk 1 south walk 1 north walk 1 south walk north

Interior Design
pickup mov 2 0 loop: mov 7 1 paint: pickup west walk [0] east walk [1] south drop sub [1] 1 1 walk north walk [0] west jgt [1] 1 paint mov 8 0 jmp loop

Firefighting
bucket: pickup east walk 1 east drop west add [0] 1 0 jlt [0] 8 bucket fire: walk west pickup walk [1] east drop add [1] 2 1 jmp fire
Paul Verkeufen
Guess the Password
walk write 3 walk east walk 3 south walk east write 2 walk 2 south turn east write 2 walk south walk east walk south walk west pickup walk 14 east drop walk east

True Democracy
loop: walk south mov 0 2 read 0 count: read 1 sub [0] 1 0 jeq [1] 1 yay jeq [1] -1 continue sub [2] 1 2 continue: jeq [0] 0 result jmp count yay: add [2] 1 2 jmp continue result: walk north jgt [2] 0 yayWin jlt [2] 0 nayWin write -1 jmp loop yayWin: write 1 jmp loop nayWin: write 0 jmp loop

Cleanup on Aisle 5
clean: pickup east walk east walkc 0 north jeq [0] 1 up drop south jmp clean up: walk [0] south drop north jmp clean

Advanced Firefighting
loop: add [1] 1 1 walk pickup turn clock turn clock walk [0] drop add [0] 2 0 turn clock jeq [0] 18 next turn clock jlt [0] 18 loop next: mov 0 0 jeq [1] 9 loop walk 8 south walk 1 east turn counter jmp loop

Home Improvement
pickup mov 1 0 outer: pickup west read 3 east add [3] [1] 1 read 2 check: jlt [1] 19 paint sub [1] 19 1 add [0] 1 0 jmp check paint: walk [0] south walk [1] east walk 1 east drop west sub [2] 1 2 add [1] 1 1 walk west walk north jeq [2] 0 outer pickup west jmp paint
Karl Franz F. L. von Linz
Would you kindly?
walk right

Hacking Forensics
walk west loop: read 0 west add [1] [0] 1 walk 1 south add [2] 1 2 jne [2] 21 loop walk 10 north walk east sub 230 [1] 1 write [1] east
Ragged Fuhrers
Decryptor
loop: read 0 west read 1 read 2 mov 1 3 jeq [1] 0 skip calculate: add [4] 1 4 mov [3] 5 multiply: jeq [3] 0 skip add [0] [6] 6 sub [5] 1 5 jgt [5] 0 multiply mod: sub [6] [2] 6 jge [6] 0 mod add [6] [2] 6 mov [6] 3 mov 0 6 jlt [4] [1] calculate skip: write [3] east mov 0 4 jmp loop
Diego Lorenzo Vega
Dodge the lasers
walk east walk 7 north wait: add [0] 1 0 jlt [0] 8 wait walk 1 west red: walk 3 west walk 1 east jmp red

Chessmat Painter
pickup mov 1 3 mov 12 4 loop: pickup west walk [[2]] south walk [[3]] east jeq [2] 1 turn continue: drop walk [[3]] west walk [[2]] north add [[3]] 2 [3] jlt [[3]] [4] loop mov 0 [3] add [[2]] 2 [2] jle [[2]] [4] loop mov 0 0 mov 1 2 mov 0 3 add [4] 1 4 jmp loop turn: turn south jmp continue
MarvGPT
Free MarvGPT DLC required:

https://steamhost.cn/app/2764520

GPT Cleaner I
walk 6 south walk 19 west walk 1 north outer: walkc 1 east jeq [1] 19 next pickup walk [1] west drop jmp outer next: walk 19 west walk 1 north jmp outer

GPTIS-9
loop: read 0 north jeq [0] 0 end add [1] 1 1 jeq [0] d south jeq [0] l west jeq [0] r east jeq [0] u north south: walk 1 east walk 2 south walk 1 west jmp loop west: walk 2 west jmp loop east: walk 2 east jmp loop north: walk 1 east walk 2 north walk 1 west jmp loop end: walk west walk south walk 4 north walk 7 east write [1] south

Stock Value Influence Icon
pickup pickup north outer: read 0 east jgt [0] 0 paint walk 1 south jmp outer paint: sub 19 [0] 0 walk [0] west drop west jeq [0] 0 step continue: walkc 0 north walk east pickup north walk [0] south jmp outer step: walk 1 west jmp continue

Secret Santa
read: add [0] 1 0 read [0] jne [0] 9 read outer: walk west mov 0 0 add0: add [0] 1 0 jeq [0] [[0]] add0 walk east [0] pickup north walk west walk east [[0]] drop west pickup north drop east pickup west drop north pickup east walk west walk east [0] drop north walk west walk east [[0]] mov [[[0]]] [0] walkc 0 west mov [0] [0] jmp outer

Exchange presents
loop: read 1 north line: walk [0] south walkc 2 west sub 9 [2] 2 jeq [2] [1] next jlt [2] [1] find sub 9 [2] 2 pickup walk [2] east leave: walk 1 south walkc 2 west jeq [2] 0 leave walk 1 east sub [2] 1 2 drop west walk [2] east walk north jmp line find: sub 9 [2] 2 walk [2] east walk 1 south walkc 2 west sub 9 [2] 2 jeq [2] 0 find pickup sub 9 [2] 2 walk [2] east walk north walk [0] south walkc 2 west walk 1 east sub [2] 1 2 drop west walk [2] east walk north jmp line next: sub 9 [2] 2 walk [2] east add [0] 1 0 walk north jmp loop

GPT Cleaner II
walk 8 north pickup west loop: drop north walk 1 west first: walkc 1 south jeq [1] 15 end body: pickup walk 1 east walk [0] east drop walk 1 west walk [0] west walk [1] north jmp first end: pickup walk 1 south jeq [0] 16 terminate walkc 2 west jeq [2] 0 continue1 walk [2] east drop west jmp reset continue1: walk 1 south drop walk 1 north reset: walk 16 north walk 1 east pickup north walk 1 west walkc 2 west walk [2] east jeq [2] 0 throw continue2: add [0] 1 0 jmp loop throw: walk 1 north drop walk 1 south pickup west jmp continue2 terminate: walk 1 south drop walk 18 north pickup east drop north

GPTIS-81
walk 1 east walk 4 south walk 1 east read 0 north jeq [0] 4 third read 1 north jeq [1] 43 second write 21 south write 30 write 63 second: write 3 south write 10 write 10 write 20 write 13 write 30 third: write 0 south write 401 write 11 write 201 write 15
R.Y.R
The End - Better Years to Come...
walk 3 east walk north pickup west walk east walk south drop east

The End - A New Dawn
walk 3 east walk north pickup west walk east walk south drop
Bill Davis
Greatest Common Divisor
read: read 0 north read 1 loop: jeq [0] [1] found jgt [0] [1] greater sub [1] [0] 1 jmp loop greater: sub [0] [1] 0 jmp loop found: walk 4 east write [0] north walk 4 west jmp read

Least Common Multiple
read: read 0 north read 1 mov [0] 2 mov [1] 3 loop: jeq [3] [2] output jlt [3] [2] else add [2] [0] 2 jmp loop else: add [3] [1] 3 jmp loop output: walk 4 east write [3] north walk 4 west jmp read

Prime Decomposition
start: read 0 north walk east mov 2 1 loop: mov [0] 2 mov 0 3 decrease: sub [2] [1] 2 add [3] 1 3 jgt [2] 0 decrease jne [2] 0 else write [1] north mov [3] 0 jmp continue else: add [1] 1 1 continue: jgt [0] 1 loop walk west jmp start
Janine Leubwitz
Kind of messed up
maze: walk turn clock jmp maze

Kind of even more messed up
add [0] 19 0 walk [0] turn clock maze: walk [0] turn clock sub [0] 1 0 jmp maze

Clever Cleaning
mov 6 0 rows: walk east sub [0] 1 0 jeq [0] 0 columns walk 2 north walk west walk 2 north jmp rows columns: walk south walk 2 west walk north walk 2 west jmp columns

Binary Painting
pickup mov 1 0 circle: add [18] 1 19 add [[18]] [[18]] [19] mov [19] 18 jne [18] 10 circle go: read 17 west mov 9 18 lp: jlt [17] [[18]] sub sub [17] [[18]] 17 walk 10 east pickup walk [18] west walk 1 west drop east walk west sub: sub [18] 1 18 jne [18] -1 lp walk 1 south jmp go

Division II
input: read 0 west jge [0] 0 loop sub 56 [0] 0 loop: jlt [0] 57 break walk 1 south sub [0] 57 0 jmp loop break: walkc 0 north write [0] east jmp input

Maze Sprinter
go: turn clock walkc 1 jeq [1] 0 nop ha: turn counter turn counter sub [1] 1 1 walk [1] turn clock turn clock jmp go nop: turn counter walkc 1 jeq [1] 0 left jmp ha left: turn counter jmp go

Cleaner I
pickup loop: read 0 east sub [0] 1 0 read 1 sub [1] 3 1 pickup west walk [0] south jeq [1] -1 correct walk [1] east continue: drop walk [1] west walk [0] north jmp loop correct: walk 1 north mov 0 1 turn south jmp continue

Cleaner II
walk north mov 1 0 place: walk east pickup south walk [0] west drop walk [0] east walk 1 south add [0] 1 0 jlt [0] 18 place walk 19 west walk 1 north replaceFirst: pickup east walkc 0 north drop east sub [0] 1 0 walk [0] south walk east jgt [0] 1 replaceFirst walk 1 south walk 3 east mov 2 1 replaceSecond: walkc 0 north pickup west walk [1] south drop west walk 1 east add [1] 2 1 jne [0] 15 replaceSecond walk 1 south walk 19 west fire: walk 1 north walkc 0 east pickup walk [0] west drop jmp fire
Olivia Kavanagh
Reverse Sequences
walk north loop: walk west read 0 mov [0] 24 keep: read [24] sub [24] 1 24 jne [24] 0 keep walk east output: write [[24]] add [24] 1 24 jge [0] [24] output jmp loop

Join Sequences
start: read 36 jeq [36] 0 output add [36] [37] 37 loop: read [38] add [38] 1 38 jne [37] [38] loop jmp start output: walk 8 east walk 4 south walk 8 west write [37] final: write [[39]] add [39] 1 39 jmp final

Tile Organizer
loop: walk [0] south walk 1 east column: walkc 0 north jeq [0] 10 loop pickup walk [0] south walk 1 east add [0] 1 0 walk [0] south drop west walk [0] north walk 1 west jmp column

Simple Sort
walk north loop: add [11] 2 11 walk west read 0 add [[0]] 1 [0] read 0 add [[0]] 1 [0] read 0 add [[0]] 1 [0] walk [11] east mov 1 0 output: jgt [[0]] 0 write jgt [[0]] 0 output jeq [0] 10 loop add [0] 1 0 jmp output write: write [0] north sub [[0]] 1 [0] jmp output

Stacker
input: walk west read 29 jeq [29] - remove add [0] 1 0 read [0] jmp input remove: walk east write [[0]] sub [0] 1 0 jmp input

Small Division
loop: read 0 west calculate: add [0] 124 0 jgt [0] 0 calculate jlt [0] -15 calculate jgt [0] -8 output add [0] 15 0 output: write [0] east jmp loop

Dequer
loop: walk west read 0 jeq [0] + end jeq [0] < first jeq [0] > last end: add [29] 1 29 read [29] jmp loop first: walk east write [1] east sub [29] 1 29 mov 2 28 push: sub [28] 1 27 mov [[28]] [27] add [28] 1 28 jne [28] 21 push jmp loop last: walk east write [[29]] east sub [29] 1 29 jmp loop

List Handler I
read 18 go: read 16 read 17 add [[16]] 1 [16] sub [16] 1 16 add [16] [16] 16 walk [16] east write [17] north walk west sub [18] 1 18 jne [18] 0 go walk east mov 14 16 mov 1 17 full: write [[17]] east jeq [[17]] 0 end lp: walk [16] west read 15 north walk east write [15] sub [[17]] 1 [17] jne [[17]] 0 lp end: add [17] 1 17 sub [16] 2 16 jmp full

List Handler II
read 0 add 1 [129] 129 a: read [129] jne [[129]] -1 b read [129] mov [129] 127 sub [127] 2 127 d: jeq [[127]] [[129]] e sub [127] 2 127 jmp d e: mov -999 [127] add 1 [127] 127 mov -999 [127] add [[129]] 100 126 sub [[126]] 1 [126] mov 0 [129] jmp c b: add [[129]] 100 126 add 1 [[126]] [126] add 1 [129] 129 read [129] add 1 [129] 129 c: add 1 [128] 128 jlt [128] [0] a walk down mov 1 0 f: add 100 [0] 126 write [[126]] jeq [[126]] 0 j i: mov 91 125 g: jeq [[125]] [0] h sub [125] 2 125 jmp g h: mov -999 [125] add 1 [125] 125 write [[125]] mov -999 [125] sub [[126]] 1 [126] jgt [[126]] 0 i j: add 1 [0] 0 jmp f

Hard Sort I
loop: walk west read 10 mov [10] 15 input: read 11 add [[11]] 1 [11] sub [10] 1 10 jgt [10] 0 input walk east write [15] output: jgt [[10]] 0 write jgt [[10]] 0 output jeq [10] 9 loop add [10] 1 10 jmp output write: write [10] sub [[10]] 1 [10] jmp output

Hard Sort II
a: walk left read 49 b: read [48] add 1 [48] 48 jlt [48] [49] b mov 0 48 mov 1 47 c: mov [47] 46 d: sub [46] 1 45 jge [[46]] [[45]] e mov [[46]] 44 mov [[45]] [46] mov [44] [45] e: sub [46] 1 46 jgt [46] 0 d add [47] 1 47 jlt [47] [49] c walk right write [49] jeq [49] 1 check f: write [[48]] g: add 1 [48] 48 jlt [48] [49] f mov 0 1 mov 0 48 jmp a check: jlt [0] 0 f write [1] jmp g

Project ♥♥♥♥♥♥♥♥♥ Phase 1
a: read 49 up jeq [49] 62 b jeq [49] 60 c jeq [49] 43 d jeq [49] 45 e jeq [49] 46 f jeq [49] 44 g b: add 1 [48] 48 jne [48] 20 h mov 0 48 h: jmp a c: sub [48] 1 48 jne [48] -1 h mov 19 48 i: jmp a d: add [[48]] 1 [48] jmp a e: sub [[48]] 1 [48] jmp a f: write [[48]] right jmp a g: read [48] left jmp a

Project ♥♥♥♥♥♥♥♥♥ Phase 2
mov 101 117 mov 20 118 a: read [118] up jeq [[118]] 0 p add [118] 1 118 jmp a p: mov 20 118 n: jeq [[118]] 43 b jeq [[118]] 44 c jeq [[118]] 45 d jeq [[118]] 46 e jeq [[118]] 60 f jeq [[118]] 62 g jeq [[118]] 91 h jeq [[118]] 93 i j: add [118] 1 118 jmp n b: add [[119]] 1 [119] jmp j c: read [119] left jmp j d: sub [[119]] 1 [119] jmp j e: write [[119]] right jmp j f: sub [119] 1 119 jne [119] -1 j mov 19 119 jmp j g: add [119] 1 119 jne [119] 20 j mov 0 119 jmp j h: jne [[119]] 0 l m: add [118] 1 118 jeq [[118]] 93 j jmp m l: mov [118] [117] add [117] 1 117 jmp j i: sub [117] 1 117 jne [[119]] 0 k mov 0 [117] jmp j k: mov [[117]] 118 add [117] 1 117 jmp j

Hardester Sort
a: read 0 left jeq [0] 0 b jeq [0] 1 c jeq [0] 2 d jeq [0] 3 e add [1] 1 1 jmp a c: add [1] 64 1 jmp a d: add [1] 16 1 jmp a e: add [1] 4 1 jmp a b: jlt [1] 64 f sub [1] 64 1 write 1 right jmp b f: jlt [1] 16 g sub [1] 16 1 write 2 right jmp f g: jlt [1] 4 h sub [1] 4 1 write 3 right jmp g h: jlt [1] 1 i sub [1] 1 1 write 4 right jmp h i: write 0 jmp a
Credits
ASVdeM[itch.io] for:
  • List Handler II
  • Hard Sort II
  • Project ♥♥♥♥♥♥♥♥♥ Phase 1
  • Project ♥♥♥♥♥♥♥♥♥ Phase 2
  • Hardester Sort
9 Comments
Hanni  [author] 2 Nov, 2024 @ 4:30pm 
You are welcome! :)
DDtective 1 Nov, 2024 @ 4:19pm 
Thanks Hanni! You're the best :)
Hanni  [author] 1 Nov, 2024 @ 3:31pm 
@DDtective & @Pri I've updated the guide! Thank you for your patience :metalhorns:
Hanni  [author] 26 Oct, 2024 @ 6:19am 
I'm so sorry! I will update the guide in the next days, promised :)
DDtective 22 Oct, 2024 @ 6:00pm 
Hey! How was on vacation? ;P
Hanni  [author] 7 Jul, 2024 @ 11:22pm 
Totally forgot the update! Will try to update the guide when I'm back from vacation :)
Pri 7 Jul, 2024 @ 5:35pm 
Do you know how to get the free dlc achievement?
Hanni  [author] 23 Feb, 2024 @ 12:38pm 
Yes! Will update the guide next week :)
DDtective 21 Feb, 2024 @ 7:08pm 
DLC's released ;)