Jump to content
BrainDen.com - Brain Teasers

All Activity

This stream auto-updates

  1. Earlier
  2. actually this seems pretty straight forward to me, the angel simply turns off all lit lanterns and wins.
  3. Was there an easier method? Concave
  4. Good. Yeah, I overthink everything and can get rather paranoid.
  5. Here's an example from my code's 6 lantern output: 111110 <one lit lantern (interpret 0 as "on" and 1 as "off") 111101 <one lit lantern You suppose the devil turns the lantern 5 on. But what if he turns the lantern 4 and not 5 on? 111110 <one lit lantern (interpret 0 as "on" and 1 as "off") 111010 your turn P.S. I am not touchy (did not even think it could be interpreted this way), but I think things over. In the last time, I wrote a lot of nonsense, i.e. my first answer.
  6. And by "put the devil in his place", I didn't mean you @harey. I reread that and remembered you said "As I am a nice guy, I let you the role of the angel." So if you found that belittling, I apologize, as that was not my intent. I am sure you see things I don't and vice-versa.
  7. First, let's nail down the definition of configuration so we know exactly when the devil wins. It cannot simply be the state of the lanterns, since not changing a lantern on a given step would then repeat the configuration. So the location of the devil and angel need to be part of it. There are two ways I see of incorporating this. Include which lantern number the devil and angel are at and the string of lantern states. Which could be notated by a location marked in a string of lantern states (e.g., "01101;001") or a number and the string (6,01101001). The lantern numbers don't matter, just look forward from the lantern the angel and devil are at (e.g., ";00101101"). And then you don't need the location marker ";" because it is always at the front. Option 1 has more states, lanterns x 2^lanterns compared to just 2^lanterns. Let's choose option 2 since less states means more of a chance of repeat and gives the devil a better chance. That is the notation I used for my code. I notice that you use the word "turn" to sometimes mean one whole stroll around all the lanterns. That is something that threw me off a little. I'd call that a revolution or a full rotation. Alright, time to put the devil in his place.
  8. @EventHorizonMy post is unrelated to yours. The number of lamps is not important, just a little bit more that those I quote. "Let's start with one lantern lit, i.e. 33.": This is not a binary number, it is the 33rd lantern assuming the starting position is the 1st lantern (conveniently chosen), following the lantern 32 and followed by the lantern 34.
  9. I couldn't follow that, harey.
  10. recreating the results of the code...
  11. Hello everyone, I’ve created a little puzzle that follows the cryptographic principle of zero-knowledge proof. Let P = xx, the age of Peter To find xx, I will provide you with means to verify the statements of the puzzle, without giving you any direct informations about the ages of the characters. The ages of the characters are not given but can be found. Although there are an infinite number of answers that could verify the information I provide, there is one answer that can be verified to 99% assuming the puzzle is honest and verifiable, and that Peter has a realistic age and life. How old is Peter ? - Peter has 5 children, Matthew, Nancy, Phil, Quinlan and Ryan - Peter’s age is the sum of the ages of all of his children - The concatenation of his children’s ages forms a palindrom - Peter’s age is a semi-prime number - 2 of his children are the same age - One of his children is half the age of one of his older siblings - Quinlan is younger than Phil - Only two of his children have a job - At least 2 of his children have a palindrome age - Matthew can’t read - Peter didn’t have a child before the age of 30 - If x is the age of the child < 10, then we’ll write 0x, such that a 1 year-old child = 01
  12. sorted configurations with 6 lanterns (and added devil best choices I omitted before) 5 lanterns 4 lanterns 3 lanterns Edit: Another thing of note. The devil and angel both choose between the same 2 options once each (except the choice between 000...00 and 000...01 for angel and 111...10 and 111...11 for devil, due to angel win conditions).
  13. Edit: Oops. I guess switch to 1 meaning off and 0 meaning on to match the story. Who wins? Ugly Strategy with not much intuition as to how/why it works. (Obviously, I don't consider this as the answer...) Yay code Code output for 4 lanterns 5 lanterns 6 lanterns
  14. These trivial examples show that for small values of N (the numbers of lanterns) the Angel wins. You seem to be claiming that that the Devil wins for larger values of N, and that all it takes is two OFF lanterns that are not adjacent. So lets analyze the case of three lanterns that are initially OFF, ON, OFF. If the Devil does not switch the 1st lantern ON, then the Angel switches the 2nd lantern OFF, winning immediately after. If the Devil switches the 1st lantern ON, the the Angel does not switch the 2nd lantern, and the Devil cannot switch the 3rd lantern as this would lose immediately. So after the first "pass" the lanterns are in state ON, ON, OFF, and from here the Angel wins by flipping the first two lanterns. But maybe this case is also "trivial and uninteresting", but then what is the smallest N where the Devil can actually win, and what is the initial state?
  15. Since the Angel cannot turn ON a lantern that is currently OFF (only the Devil can do that), as long as there is at least one lantern in the OFF state from the beginning, the Angle cannot win by having all lanterns ON. This would require the Devil to turn ON the final lantern that will deliver the win to the Angel. Assuming the Devil wants to win, this will never happen, so the only way the Angel can win in practice is when all the lanterns are OFF. These are some trivial and uninteresting examples and I'm not sure how they help.
  16. Let's consider how the game might go for some small numbers of lanterns. If there is only one lantern, then the Angel wins immediately, regardless of it's state. If there are two lanterns, then there are four cases (of initial state of the lanterns): off, off : The Angel wins immediately. on, on : The Angel wins immediately. on, off : The Angel switches the first lantern off, and wins immediately after. off, on : The Devil has a choice what to do with the first lantern. If the Devil switches it on, then he loses immediately after. If the Devil leaves it off, then the Angel switches the second lantern off, and wins immediately after.
  17. Please note the Angel has two ways od winning: 1. Turn all lanterns on. 2. Turn all lanterns off.
  18. this game seems to be impossible for the angel to win. if 50% or more lanterns are dark, the devil flips a dark lantern. otherwise, leave it alone.
  19. What if the bullet never pierces the armour, but is stuck infinitely travelling through the armour, never coming out the other side. Neither the bullet or armour have failed
  20. Hi everyone! I was active here 10+ years ago, and then on MafiaManiac for a while, before life got in the way and I stopped visiting. I've been thinking about BD and MM a lot recently, and thought I'd see if BD is still around - and I'm thrilled to see that it is! Albeit a bit less active. Either way, I'm glad I can still get into my account lol and will be checking in periodically again. Hope to see some familiar faces around
  1. Load more activity
×
×
  • Create New...