We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
In case anyone's having trouble with the timeout function: the number of operations is calculated like this:
In the code [a]b:
At [: moving to a costs one move, skipping it and moving to b costs 2 moves.
At ]: moving to b costs one move, skipping back to a costs 2 moves.
In other words: each operation is counted once, and the [ and ] characters send you to their matching characters, not the following operation (even though that would mean performing the same test twice)
BrainF__k interpreter
You are viewing a single comment's thread. Return to all comments →
In case anyone's having trouble with the timeout function: the number of operations is calculated like this:
In the code
[a]b
:[
: moving toa
costs one move, skipping it and moving tob
costs 2 moves.At
]
: moving tob
costs one move, skipping back toa
costs 2 moves.In other words: each operation is counted once, and the
[
and]
characters send you to their matching characters, not the following operation (even though that would mean performing the same test twice)