Jump to content
BrainDen.com - Brain Teasers

Leaderboard


Popular Content

Showing content with the highest reputation since 01/13/16 in all areas

  1. 1 point
    Use the twelve pieces on the left to create a chess board, The pieces may be flipped!
  2. 1 point
  3. 1 point
    Does the Indy trap appear even if it doesn't save anyone from actual death? Can they act on themselves? Do the goodie save and the Indy trap appear identically in the night post?
  4. 1 point
    If a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and two discs were taken at random, it can be seen that the probability of taking two blue discs, P(BB) = (15/21)×(14/20) = 1/2. The next such arrangement, for which there is exactly 50% chance of taking two blue discs at random, is a box containing eighty-five blue discs and thirty-five red discs. By finding the first arrangement to contain over 1012 = 1,000,000,000,000 discs in total, determine the number of blue discs that the box would contain.
  5. 1 point
  6. 1 point
  7. 1 point
    Hopefully this one has not appeared before... Suppose 27 identical cubical chunks of cheese are piled together to form a cubical stack, as illustrated below. What is the maximum number of these cheese chunks through which a mouse of negligible size could munch before exiting the stack, assuming that the mouse always travels along the grid of 27 straight lines that pass through the centers of the chunks parallel or perpendicular to their sides, always makes a 90 degree turn at the center of each chunk it enters, and never enters any chunk more than once?
  8. 1 point
    We're being intruded by migrants secluded Who stowaway past our frontier They're costing us green and will linger unseen Unless I should get into gear Their nature I'll dredge as I perch on a ledge And twisting the truth's my endeavor Exposed to the nation, and next: deportation They thought they'd endure thus forever? I promise the answer has nothing to do with politics
  9. 1 point
    Hirk had to have been a goodie: baddie wouldn't target himself for a kill, and Indy can't be killed N1.
  10. 1 point
    Player A has one more coin than player B. Both players throw all of their coins simultaneously and observe the number that come up heads. Assuming all the coins are fair, what is the probability that A obtains more heads than B?
  11. 1 point
  12. 1 point
    Roster: 1. maurice 2. Flamebirde 3. Molly Mae 4. 5. 6. Hirkala 7. bonanova 8. 9. 10. Roster: 1. maurice 2. Flamebirde 3. Molly Mae 4. 5. 6. Hirkala 7. bonanova 8. 9. 10. Mafia!!! Been too long! I don't know if I was supposed to leave it doubled, but I did. Hi, everyone!
  13. 1 point
    UN Mafia III Secret Alliance: Wincon - Last standing China -- The size of the country allowed it to send a replacement for the representative lost in the previous game. Each night chooses a player to target and remove from the game. Action is unstoppable except via save. Will use its electronic interception technologies to find out the identity of the target if target is saved. Once during the game (ODTG) can remove a vote. UN Alliance: Wincon - Last standing. USA -- The size of the nation and its offensive capabilities, demand it acts but not two nights in a row. Chooses to invade (kill) on even or odd nights at the beginning of the game. Must invade on said night, if no target is drawn it is randomly selected (cannot invade self). Germany -- Its economic influence grows steadily which leads to an increase in political influence. Sometimes is forced to save nations in dire need, but would prefer preventing actions. Each night can save a player but there's a 50% chance that this backfires in which case Germany loses its vote the next day. Russia -- Has hundreds of satellites floating in space. Can use one per night to spy an alive nation either to see who targeted it or to see who that nation acted upon. Once during the game (ODTG) Russia can instead get lucky and find out a player's true role. United Kingdom -- Has worldwide influence among its former colonies. Once per night it can blockade a country, but not the same country twice in a row. Blockading stops any day or night action except for ODTG actions and the Secret Alliance's night invasion. Australia -- Has an interesting choice of possibilities due to its cultural diversity. Has 4 agents at its disposal, each can be used once: 1. Add 1 extra secret vote, 2. Remove a vote, 3. Protect (save but cannot be cast on self), 4. Break quarantine (used during the day can make the player quarantined by Sweden able to vote and be voted for). Indy Sweden -- A nation with nothing to contribute to war and naturally inclined to peace. From time to time, may choose to temporarily side with a Faction or the other, in order to protect its own interests. Each night can quarantine a country but not the same twice in a row. Quarantine acts like a trap - saves from kills / invasions and renders the target neutral - unable to vote the next day or be voted for (but can speak). Once during the game (ODTG) can veto out a country (RID Kill) at any point during the day or the night, but will forfeit acting the next night if that happens. Sweden cannot die N1 (NK attempt won't appear in the NP). Wincon: Outlive two secret countries and the Secret Alliance. Stops game if successful. Must be alive at the beginning of the next phase in order for "outlive" to be counted. Secret targets are drawn at the beginning of the game and are known only to Indy. Rules * NP shows invasions (kill), protections (saves) and quarantines (trap). * DP shows lynched players (no hint if the vote was manipped. * Tie: D1 no lynch, D2+ all players in tie are lynched. * OOA: Night invasion (kill) >> Blockade (block) > Quarantine (trap) > Protect (save) > Regular invasion > Spy * Blockade / Quarantine will be told to the players regardless if they had an action that was blocked or not * Regular invasion can be blocked, the SA night invasion cannot be blocked, only saved from * Sweden's ODTG RID veto cannot be blocked or saved from as it happens instantly Players: 1. Thalia 2. bonanova 3. Molly Mae 4. Flamebirde 5. maurice 6. MikeD 7. plasmid Backups: 8. 9. Roles are out, Night 1 ends Monday Feb 20th at 9 PM UTC (About UTC). That means 4 PM EST and 11 PM for me.
  14. 1 point
    Hey guys, sorry I'm here. Didn't realize I could talk when I was trapped and then I'm having issues accessing the site on my phone. I'm on through Firefox now and it works better than Chrome I guess. I will catch up at lunch and see what I can contribute, hopefully before the night ends in case I was mercy/mod killed.
  15. 1 point
    @Thalia Understand, (with apologies to the players.) Hanlon's Razor. Seriously, what do we know about maurice?
  16. 1 point
    Taps watch. Oops. RIP MikeD. Would love to hear from maurice.
  17. 1 point
    You enter a room with two chests. You know that one chest has a lot of money (but you are unsure as to which). You know the other chest has half as much. Being the greedy person you are you want the most money but the chest are indistinguishable from each other outside of opening and counting the contents. You picked the first chest. Just before you open it, the owner of the chests offers you an opportunity to switch. Should you?
  18. 1 point
  19. 1 point
  20. 1 point
  21. 1 point
  22. 1 point
    foyer - 1 proves the Y since other 4 letters are known word is GLYPH gl was proven since brass = 0
  23. 1 point
    ZEBRA If 5 then wooty pooty woot
  24. 1 point
    ENTER if 5 --> woot woot
  25. 1 point
  26. 1 point
    MAFIA Cuz, yeah
  27. 1 point
  28. 1 point
  29. 1 point
  30. 1 point
    just guesing without doing calculation.
  31. 1 point
    If a lion and his tamer can run at precisely the same speed without tiring, would the tamer be safe inside the lion's circular cage? Assume the lion sits on a stool at the center of the cage as the tamer enters though a door on the perimeter of the cage. You can also neglect the size of their bodies. i.e. consider the lion and tamer as points.
  32. 1 point
    Connecting the 8 corks with web with least linear meter requires connecting with the web along the sides of the cube (no diagonals) with length 1m, and uses at least 7 segments to connect 8 corks. so the total length is 7*1m = 7 meters. and the shape could vary, as long as you pass the web only along the sides of the cube.
  33. 1 point
    Hi wiseabel, and welcome to the Den. So clearly there are several ways in which these numbers are similar and, equally clearly, we're to look for something beyond the fact they are integers. Three are odd, and a different group of three are prime. Three of the four contiguous pairs are descending. Only one of the digits (1) repeats among the numbers. At first glance, I don't see a common similarity, but I'll give it some more thought perhaps in a later post. Thanks for submitting a puzzle!
  34. 1 point
    I'll bet this is not the answer you're looking for, but it does qualify as a remarkable matchup:
  35. 1 point
    Suppose there is an equilateral triangle (side length 1/5 unit) inside a unit circle. Drawing straight lines through the circle, what is the least amount of lines that it would take to ensure we intersected (found) the triangle?
  36. 1 point
  37. 1 point
  38. 1 point
    A man enter a room. In the room there is a 2 digits number on the wall. His friend outside the room do not know the number. But just by ring the bell once, his friend know the number. how could this happen ?
  39. 1 point
    and that led me to this..
  40. 1 point
    Here's some canon fodder, could it be
  41. 1 point
    Brainy Binary gave me the hint, thanks!
  42. 1 point
    "You have an OCD of things in even numbers" "No I have not... . . . . No I have not."
  43. 1 point
  44. 1 point
    Code: #include <iostream> #define BUF_SIZE 100 using namespace std; void putInArray(int num, int* buf){ for(int i=0;i<BUF_SIZE;i++){ buf[i] = num % 10; num = num / 10; } } bool isPalindrom(int* buf){ int i=0, j=BUF_SIZE-1; while(buf[j]==0 && j>0){ j--; } while(i<j){ if(buf[i] != buf[j]){ return false; } i++; j--; } return true; } void applyIteration(int* buf){ int i=0, j=BUF_SIZE-1; while(buf[j]==0 && j>0){ j--; } while(i<=j){ int temp = buf[i] + buf[j]; buf[i++] = temp; buf[j--] = temp; } for(int i=0;i<BUF_SIZE-1;i++){ buf[i+1] += buf[i] / 10; buf[i] = buf[i] % 10; } } bool isLychrel(int* buf){ for(int i=1;i<50;i++){ applyIteration(buf); if(isPalindrom(buf)){ return false; } } return true; } int main() { int buf[BUF_SIZE]; for(int num=0;num<10000;num++){ putInArray(num,buf); if(isLychrel(buf)){ cout << num << " is Lychrel " << endl; } } }
  45. 1 point
    as before - SHOPPERS = 0, SHOPPING = 1 so ?????ING = 1. so ANYTH??? = 0 from ANYTHING = 1. In APPETITE = 5 not A??????? from ANYTHING = 1, NOT ?P?????? from SPACEMAN = 0 so ??PETITE = 5 from 6. As SOLUTION = 1, TI <= 1 so ??PE??TE is proven. Maurice, I know you're reading this ya big galoot.
  46. 1 point
    Person 1 is left behind there would be no one to kill him
  47. 1 point
    I don't quite understand the fascination with 'paradoxes' of this sort, which basically come down to which of the two statements are true, if any. I am blue. I am red. Am I blue or red? Maybe I'm green. Doesn't matter, both cannot be true. The truth is on the other side. The other side holds no truths. Or is that just it? We enjoy 'trapping' the mind in a room with mirrors on both the wall we are facing and the wall directly behind, and looking at the infinite reflections that result? I just don't get it. Can someone tell me what I am missing? I am reminded of the "bullet that pierces all vs. armour that cannot be pierced" contradiction. Similar situation, both just cannot exist. One is right, the other is wrong, or maybe both are wrong, but the contradictory elements cannot both be right.
  48. 1 point
    How does it work? I guess the lines in front hide the lines behind, showing a slightly different picture each time giving the illusion of movement.
  49. 1 point
    This is what the mother should say to the crocodile: "Crocodile, before I tell you what you will do to my child, I will tell you this: My child is the thing I hold dearest to my heart and if someone were to take him away from me, then I will spend the rest of my life studying whomever was responsible for destroying my child and destroy the one thing that he loves most in this world. If he has children of his own, I will destroy them. If not, he will have to live in constant fear that if one day he should have children, their lives will be in danger. If perhaps it is a swamp that he loves the most in the world, I will use the power of man's knowledge to destroy it. Whatever it is that he loves most will be taken away from him, and he will not know when it will happen and thus must live a life of fear. That being said, you will give me back my child."
  50. 1 point
    But then the integrity of the footbridge would be compromised and nobody could guarantee your safety. Haven't you read Stephen King's "Eye of the Dragon" and the "tension breaking point" theory?
×