Jump to content
BrainDen.com - Brain Teasers

EventHorizon

VIP
  • Posts

    576
  • Joined

  • Last visited

  • Days Won

    8

Everything posted by EventHorizon

  1. Looks like a hint is needed.
  2. What are the next 3 numbers in the sequence? 8, 6, 96, 047, 10803, 424, 878, 3, 9171, 98838, 7240, ?, ?, ? The sequence will go on indefinitely, and I tried to design it to be difficult. Notice "047" kept the leading 0....it is significant/needed. Good Luck
  3. EventHorizon

    square roots are valid...right?
  4. EventHorizon

    "and the others will vote on it" vs "If half or more of the total pirates alive" So does the pirate giving the proposal vote? Assuming he does.... (e.g., the first pirate only needs 2 other votes to have the first proposal taken). Assuming he does not have a vote.....(the first pirate needs 3 votes to live...and he doesn't get a vote) Okay...how about if a pirate doesn't get a gold piece he would rather be dead (and the pirate giving the proposal gets a vote, and pirates kill unless given an incentive not to) What other combination of assumptions might give interesting results? Am I anywhere close Noct?
  5. How about this for adding more in..... Jim, where Tim had "had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had had", had "had." "Had" had a better effect on the teacher. essentially....Tim just went hog wild writing had. Tim is probably a robot and got stuck in a loop until his batteries ran out.
  6. That is interesting...it makes me think that perhaps there is a very simple lateral thinking way of solving this puzzle. I can't quite seem to figure out what it would be yet. I'll think about it more tomorrow...I should really work on a paper...but have been avoiding it a little too much. It seems I would much rather solve puzzles and watch my team lose (grr!) than work on my paper.
  7. What I meant was that each valid square orientation pair does not have equal probability.....just thought I would fix my horrible wording....
  8. just a couple clarification questions... 1. whenever the end would fall outside the board, you can't choose that orientation....right? So one square away diagonally from a corner square (a gray square in all cases) only has 2 valid orientations to choose from just like the corner, etc. 2. is the ruler starting from the center of the chosen square or covering it completely? In other words, once the ruler is down, would 3 or 4 squares have the ruler covering part or all of them? I would assume only 3, but wanted to make sure.
  9. you can get more bananas to the bazaar than that, but that was a good effort. Question 3 actually asks how far you could travel and not how many bananas you can get to the bazaar.
  10. here's a method to get 200 bananas to a bazaar 1000 meters away when starting with 1600 bananas.
  11. EventHorizon

    looks like talha posted before I clicked reply. put answers in spoiler blocks so other people can look through the posts for any clarification and still be able to figure it out on their own.
  12. 1000 bananas may be a bit much to carry repeatedly. It may also have been in miles when I first heard it. So try to answer these when forced to ride the camel.
  13. Oops...took a little too long to edit. Let the following be questions 6-9. Question 6: How many bananas would you need to start with to be able to make a return trip from the bazaar in Q5 (with the requirement that while at the bazaar you cannot have any bananas out in the desert)? Question 7: Same a Q6, but you can leave bananas out in the desert. Question 8: If you have a capacity of C and B*C+E bananas (B is a positive integer, 0 <= E <C), how far (one way) can you ride the camel? Question 9: Same as Q8 except you need to return (eg, two way trip)?
  14. This is similar to "Apples Delivery, Hungry driver" but I heard this form back in elementary school. I also have a few more questions to ask about it. You have 2000 bananas to bring across the desert. You are riding a camel that must eat one banana per meter (ie, you cannot drop all bananas and move the camel like with the apples question). The camel can hold 1000 bananas at a time. Assume that if you go a fraction X of a meter, then the camel eats X part of a banana. Question 1: How many bananas can you bring to a bazaar 1000 meters away? Question 2: How many bananas can you bring to the bazaar (still 1000 meters away) if you started with 3000 bananas? Question 3: How far could your camel go (one way) if you started with 5000 bananas? Question 4: How much further could your camel go than in Q3 if you started with 6000? Question 5: How many bananas would you need to start with to be able to reach a bazaar 2000 meters away? Question 6: How many bananas would you need to start with to be able to make a return trip from the bazaar in Q5? Question 7: If you have a capacity of C and B*C+E bananas (B is a positive integer, 0 <= E <C), how far (one way) can you ride the camel?
  15. Using the metric "the sum over all players of the absolute value of the difference between the players probability and .2", the answer I gave previously still minimizes this. (of course, S and P are interchangeable in the answer, but I chose the one that favors Perry)
  16. I don't make too many GUIs. I wrote this to be commandline. It is most definitely a bit cryptic...I could explain certain parts if you want. To interpret the match-ups....you look at the remaining players and count from left to right (starts with P, S, D, X, E). The winner of the match is placed at the position of the player in the match furthest left. So lets say the line was 1vs2, 0vs1, 1vs2, 0vs1. This means the bracket would be as follows 1vs2 -> S vs D remaining = P, (S vs D), X, E 0vs1 -> P vs (S vs D) remaining = (P vs (S vs D)), X, E 1vs2 -> X vs E remaining = (P vs (S vs D)), (X vs E) Ovs1 -> ((P vs (S vs D)) vs (X vs E)) I didn't write it to figure out the number of byes needed....I just sorted based on the metric then evaluated them until I found a valid one. zarball.zip
×
×
  • Create New...