Pagina din magazin
Turing Complete
Toate Discuții Capturi de ecran Ilustrații Difuzări Videoclipuri Știri Ghiduri Recenzii

Turing Complete

Pagina din magazin
Vezi statistici:
Realizări globale
Turing Complete > Discuții generale > Detaliile subiectului
Redhook 23 mart. 2023 la 12:40
Storage Cracker - program not working as expected.
So I tried to "cheat" the storage cracker level by doing a binary search. To facilitate that, I went back to my ALU design and added two bootleg functions, ROR (shift bits right) and ROL (shift bits left). That let me double or halve a number to increment my guess. The function worked great, and I could guess 128, followed by 192, then 224,240, etc. and if that was too high, I could make the guess lower by half that amount, like 236, etc. It's a classic way of doing the search in a minimum number of steps.

Problem was... Every guess I sent to the output was followed by a response from the input that said the value was too high. So the guesses went 128, 64,32,16,8,4,2,1,0.

Each guess was send reg5 to output, followed by input to reg3. in to reg3 always returned 1.
< >
Se afișează 1-4 din 4 comentarii
MegaIng 23 mart. 2023 la 12:49 
Your program is probably working correctly, the level has a bug.
#1
stochastic 25 mart. 2023 la 19:57 
Edit:
Sorry it turns out not to be a bug. This level is correct. I need to enable the input when there is one.


original post:

I confirm this bug but it behaves differently. Did exactly the same method (without using hardware though) and it didn't work as I expected, except my guess is always too low. Then I manually construct a 255 and send to output, it should either be too high (input return 1) or it should be the correct guess (jump to next test). What I got instead is always 0 from input. I tried brute-force enumerate down from 255 (255, 254, 253 ...) and input never returns 1. Here's a screenshot https://gtm.steamproxy.vip/sharedfiles/filedetails/?id=2952559993
Editat ultima dată de stochastic; 25 mart. 2023 la 20:37
#2
stochastic 25 mart. 2023 la 22:37 
https://gtm.steamproxy.vip/app/1444480/discussions/0/3431201423162197535/

To Redhook: this seems to be the answer for you. Have you tried output 0?
#3
daemonaa 28 apr. la 16:10 
there must be a bug. (ver 0.1059 beta)
i first tried a binary search solution, but i figured out its useless without dividing by 2 command - its emulation with subsrtactions will eat all the profit)

so i solved it with bruteforce, with just sending incrementing value to out without even analysing input i read.

when i returned to binary search and implement a hardware div by 2 command)

and the algorytm worked fine, except it never gets an 1 on input..

unless i sent a 255 to the out before entering the search loop.

after that it works fine.
#4
< >
Se afișează 1-4 din 4 comentarii
Per pagină: 1530 50

Turing Complete > Discuții generale > Detaliile subiectului
Data postării: 23 mart. 2023 la 12:40
Postări: 4

Reguli și ghiduri pentru discuții