So to solve this, I'll go from left to right.
You can start with any column and simply apply the rule from top to bottom for that column. I represented this as both binary and R/G. To bitmask a 5-digit number, just write it out like you would a 5 digit math problem: Initial State: 11000 GGRRR If it helps, you can just think of it as R and G instead of 0 and 1.
This is called a truth table, where A & B are your inputs and X is the result. Essentially, if you XOR a 0 & 0 or 1 & 1 the result is a 0, and if you XOR a 1 & 0 or 0 & 1, the result is a 1. So what does this all mean? If you don't know how to do bit masking, then this might be a little confusing however, here's gist of using an XOR(⊕) operation. I've only been able to test this on my account, so if anyone would like to test this and report their results, I'd greatly appreciate it!īit Masking using the XOR gate (skip if you already know how) This could mean that initial position might be random for each person. Note: I read online that an activation sequence that works for one person may not work for another. So if you activate the valve, switch and then the valve again, the valve will be back in position 1 and the switch in position 2. This rule applies even if other devices are activated in between. Activating the Valve a second time would apply the mask '10101' and put the valve back in position 1. Activating the Valve, for example, would apply the mask '11000' and put the valve in position 2. Initially, all devices are set to position 1. Each time you activate a device, it alternates applying the two masks to the current state of the lights.īefore going any further, I think it will help to see the mask table.
A mask is simply a predetermined binary number that is used to perform a bitwise operation with. Each device has 2 5-digit binary masks associated with it. The room contains 4 devices: Valve, Lever, Switch and T.V.
0 kommentar(er)
