Ranking update! Grand Prize rank update: So far (taking into account who has solved the most, who has helped the most, who has tried the hardest, who has the best manners, who has accumulated the most eligibility points...etc) this is the updated top 10 list of names of who's up for the grand prize!!! 1. hiurdin 2. jwcasser 3. cloudcastles 4. pajo_ojap 5. staulcub 6. Daldaris 7. cjsbug 8. speed4mee 9. warcrack 10. KoOne23 Note: This list may change depending on how the rest of the contest continues... If your name hasn't made the list - you need to try harder (you may just be in position 11)! Extra note: You don't need to actually solve the puzzles in order to be eligible... you may earn eligibility by just being helpful in the thread! Good luck everyone!
Wow, congrats, you're good! I wasn't online at the time this puzzle was posted, but I'm definitely not as a great a puzzle solver as you are.
Nice and quick work there jwcasser. I totally missed this contest posting. I went to bed and woke up and the puzzle was already solved. Maybe the next one or the one after that...ad infinitum, or is that ad nauseum
I decided to see if I could solve it myself. I hope you don't mind if I explain it. the number string is decode as follows, where the four just means its the 4th or last part of the path combination. So we are left with this 0 10 1110 3110 132110 1113122110 311311222110 ???????? I haven't seen this type a puzzle in awhile so it took me a few, but you interpret it again 'literally' so you start with 0, then you have the count of how many digits of that number, so then you end up with 10, which means you have one digit of type zero. then you have one digit of type one and one digit of type zero which is 1110, then you have three digits of type one and one of type 0 = 3110,....then taken to the last part you have one digit of type three, two digits of type one, one digit of type three, two digits of type one, three digits of type two, two digits of type one and one digit of type zero. this gives you 13211321322110. The second part of the puzzle: My inventory states that I contain 8 white optical circuits, 4 red optical circuits, 6 yellow optical circuits, and 2 black optical circuits. Since your current optical circuits don't work - you can't see to know which color is which for me to dispense! So I ask you this... What's the least number of optical circuits that I would I have to dispense to you to ensure that you had a matching pair? Well simply if you draw one circuit of any color, than since you only need a match 4 more draws will net you a matching circuit, since at worst each previous draw will be one of the 3 other colors. So that mean 4 draws one for each color plus 1 to make a match = 5. add the 5 to the previous number 13211321322110 + 5 = 13211321322115 and shazam jwcasser is the winner. Again good work. Hope the above makes sense. I'm not always good at explaining how I get the right answers.
Very good! I think you earned some "helpful" points! Plus, I think a few more of you here are earning yourself some "good-sportsmanship" points! Well Done! Well... I've got some good news ... and some bad news The good news first.... I finally got the dispensing machine to dispense me a matching pair of optical circuits!!!! now for the bad news.... Either they are a bit dodgy or they haven't quite warmed up yet... because everything is a bit... well... blurry So I can't really see much yet. A bit like this next data packet that I found (the 12th one so far): Good luck solving it... I hope you can work it out!
I was totally lost with the first part of the 11th packet I was thinking in quarternary numeral system The second part was much easier for me. Thanks for sharing the solution, it was giving me a headache how that crazy line of numbers showed up
12th data packet! In case you missed it... Here's the 12th data packet... Sorry it's a bit blurry... a bit like my vision at the moment... these new optical circuits still haven't warmed up properly yet! Good Luck deciphering!
1. Password: NEEDGLASSES_MEM_RECOVER_12 2. I'll forfeit the ezone app to earn more eligibility points, and I nominate KoOne23 to receive some eligibility points. 3. From the blurry image, I noted the colors red, yellow, and cyan ... I figured the disco screenshots had a higher chance because there's a lot of cyan, and also I don't think you've used any disco pictures in the puzzles yet (or not many). http://iphone.ezone.com/disco06/ had the required colors in what seemed to be in a matching pattern.
Grand prize ranking update! Grand Prize rank update: So far (taking into account who has solved the most, who has helped the most, who has tried the hardest, who has the best manners, who has accumulated the most eligibility points...etc) this is the updated top 10 list of names of who's up for the grand prize!!! 1. cloudcastles 2. hiurdin 3. jwcasser 4. pajo_ojap 5. staulcub 6. Daldaris 7. cjsbug 8. speed4mee 9. KoOne23 10. warcrack Note: This list may change depending on how the rest of the contest continues... If your name hasn't made the list - you need to try harder (you may just be in position 11)! Extra note: You don't need to actually solve the puzzles in order to be eligible... you may earn eligibility by just being helpful in the thread! Good luck everyone!
You'd better get cracking warcrack - you might slip out of the top 10! I'd better find another encrypted data packet to decipher!
Oops, sorry you got pushed down by one place. I nominated KoOne23 since he was at the bottom and I thought he could use the most eligibility point boosting. If I'm lucky enough to win again while the same conditions apply and if you're still at the bottom, I'll nominate you next.
Wow that was fast! Nice job! I was looking at the disco pics too, but on the floor patterns instead. This battle for the top spot is going to get interesting.
I still doubt I could possibility win since my ability to solve the toughest puzzles is ... well, zero. I can only solve these picture hunting ones. Anyhow, this contest is getting increasingly fun so I don't mind.
Thanks all for the support, and thanks pajo_ojap for the solution. I didn't have time to write the whole thing out and was almost late to class as it was.
