Solv-a-bees

Today has been a rather comedic day. I've been looking over the shoulder of our production team as they put the finishing touches on SAW. Our ultra-talented writer, Nik, has been diligently scripting the Second Chance text for the game. As always, he's been cracking some truly side-splitting puns! (My favorite kind of joke.) Not all of them will make it in the final version, but if they're even half as funny, I'll be spending a lot of time "making fatal errors" during my SAW play-through.

A couple of the other programmers were working on the outtakes for SAW at the same time. Let me tell ya, the best kind of office meeting is the "Outtake brain-storming session." It's not a real meeting, more of an informal hallway-pow-wow. But still, it was fantastically hilarious. It got me thinking; A good way to beat the summer heat wave... lots of laughter.

I've got to post the Weekend Puzzle Answer, cause you all solved it in record time! Congrats to those that reached the final solution.

- Puzzle 67 Answer -

12151511
914
2085
12921811825

To solve this one it might take a little [ guess and check ]. The numbers relate to [ letters ] based on [ A = 1, B = 2, etc. ] You need to [ separate ] them in order to create each set of [ words ]. It should look like this
-
12 - 15 - 15 - 11
9 - 14
20 - 8 - 5
12 - 9 - 2 - 18 - 1 - 18 - 25
-
[ Substitute ] for each number and you get:
[ Look in the Library ]

--

Definitely a Secrets Can Kill REMASTERED reference. But maybe it can be taken at more than face value. Specials await!

- Novel -