phil1882

"shhh they'll hear you! you shouldn't be here, flee while you can!"

somehow based on bonanova's past riddles i suspect binary isn't really integral to the problem. oh, its something to be considered of course, and i'm betting it helps explain the answer, however...

as framm aproaches the largest building, he sees several manta rays on the ceiling, huddled together. they seem scared.

more ground shutters after loki's shout.

upon flame's shout, a small part of the ground seems to shutter, then settle down.

on a 5x5 grid, you currently have all lights on. for each light you switch, each of the four othaganol lights also gets switched. (if off, becomes on, if on becomes off.) the board doesnt wrap around, so switching a corner light only affects two other lights. what's the fewest moves to switch all the lights to the off state?

the group bids farwell to the mermaids, and begins their journey toward the manta rays. after a couple hours, they reach their destination. the city is quite stange, it's upside down, or so it seems, with the vast mjority of the buildings hanging from the ceiling. as they aproach, they have yet to see any manta rays. the place is giving off an eerie calmness that is already beginning to be felt by the travelers.

the king, still flabbergasted but recovering his wits, turns to his people. "my fellow mermaids, we have lived under the fear of the duranga for centuries. but these brave souls have rid us of that menace. no more will we cower at the name. no more will fear loom in the horizon. let us take hope for an unimagined bright future." turning to the fellow tavelers, he places a hand on the sea horse. "we are forever in your debt. i know it is not much, but i offer you a small token of our aprecation." he pulls out a red gem stone. "this stone has amazing regerative properties. if one of your fellows falls in battle, you may use it to bind thier wounds quickly."

ooc: should i move the story along? i was waiting for more posts, but perhaps i shouldn't.

i belive this site has been posted once before, never the less, i found it to be quite fun. http://tonematrix.audiotool.com/_/10g.840.g40.10g.9.1400.i0.6.o00.i0.0.1409.210.82.84.210 click on the grid and press space to clear all. the above represents a no-three-in-a-line solution to a 16x16 grid. http://tonematrix.audiotool.com/_/10.100.1000.400.20.2.800.1.40.8.g00.g0.800.80.4.g and here's a solution to the n-queens problem.

plainglazed first try results in undefined. molly's try only has 5 numbers.

alive and kicking, somewhere around here. the dead monster, with severe head wound, settles on the sea floor with a puff dust eminating beneath him. the murmaids aproach, cautiously. several stick barbs in it to be sure it is indeed dead. the king seems speechless. he aproaches the group but doesn't quite know what to say. "i....i dont... belive.... how?"

hmm, not convinced its as simple as bushindo/plain makes it out to be.

nicely done super, somehow i had a feeling you would be the one to solve this :-)

so plasmids problem got me to thinking; given a set of integers, smallest being 1, can you always find the optimal change (fewest number of coins)? consider the following set. 1 4 9 25 49 121 169... where you have every prime number squared. try finding the optimal change for... 288 and 1368 and 9408

i'm pretty much in favor of gay marriage, though it took me some time to get to such a point. however, i dislike the federal government getting involved in the matter. i'm kinda with ron paul on this issue, government should stay out of the marriage issue altogether, and should simply respect mutual agreements (contracts).

so basically its a random game i thought might be fun. each person tries to generate the best set of random numbers they can to get the largest result. after about 10-15 posts ill reveal the winner.

a pretty simple game; i'll post a series of operations; add, subtract, multiply, divide, and parenthesis; in a spoiler tag. your objective will be to generate the largest result you can without looking at the spoiler. you can use 1-5 digit numbers positive or negative. division will be round down to the nearest integer. you can post more than one series if you wish; up to 5; i'll take the largest one. the winning player should post the next series.

hmmm.

here's kind of a depressing paradox. let's start with the assumption that identical things are identical. now imagine creating an exact copy of the whole universe. if a week from friday you do the exact same thing in both universes, then what you do a week from friday is pre-determined by the state of the universe. therefore free will is an illusion. or if what happens a week form friday is different in both universes, then you have free will, but the principle of identity is invalid at the universal level. so which would you perfer, free will but no identity, or identity, but no free will?

a paradox is simply a contradictory or obtuse statement, not necessarily a physics denying one. its quite possible for paradoxes to be stated, they just cant exist. in what sense does a statement exist?

let's get a role call to see who's still here.

ah! thanks talia boy do i feel stupid! i'm still working through it, but i think super has the sequence. i think in gereral however, you would want every other fib number for easy optimizing purposes.

hey super. that seems close, but not quite. how would you get the number 25? (9 9 4 1 1 1?) though i think the idea is close.

yeah i think 89 is again not reachable with that squence.