Noxid

please tell me you arent talking about the burnt note

Until exams are over. Not long to go. Hopefully no one decides they need the computer for some stupid reason that they could use a different computer for.

Hate to sound stupid right now but that thread is..... where...?

ah... alright...

I'll use that from now on when i need to...

is the secret item in the mimiga village itself (the map "mimiga village") or somewhere around there?
i just searched for a half an hour both before, and after the demolition, in every room, and talked to every mimiga like 5 times until they got pissed at me... im totally missing something here..
how about a little hint

because it will just give three dots..

you know that after the demolition you cant get to the yamashita farm.. right?

does it have something to do with that block in kings house that you stand on and it says it will take days to dig?
its probably one of the two blocks on the right bottom left in kings house after the demolition...
now how do we get there..
your mod is great! haha

i cant seem to find it and im looking all over the place. is it something hidden? (like something you dont see but when you press down it goes off?)

lol.. he talks like ballos.. that dead mimiga guy

are you talking about the soap?

Thanky very much.
I'll have to remove a pm or two though, it's full atm.

Not in the usual realm means completely non-cs related, I'm afraid. You don't have to do any work.
Basically, I am wondering if I should get Minecraft or not. Obviously I've heard loads about it, but I want to try it before investing my money. I don't usually give mulaa for games.
So do you have a Minecraft account and if so could I borrow it for a day or so? I'll be super sure to make a new world and not mess with any of your stuff.

If you want to say no, that makes perfect sense. I don't know if I'd say yay.

Can I ask you a favor?
It is not in the usual realm of what I ask, mind.

Could you lend me an eye? Are see curlybrace? I'm just not too sure.

Well, technically he's also a mod.

go on irc!

Oooohh... What I prolly would have done is made the extra flag an indicator that you DON'T want the ! to appear, since having it appear is the "default" option, but it's probably kinda late for that now, I guess...

I'm planning on giving more constructive feedback on your mod eventually, but I'm wondering why you don't just make it so that all entities with the "call event on interaction" flag give the exclamation mark automatically without you having to set another flag?

The best method I could think of that wouldn't take you forever to program would follow an algorithm something like this:

1) Create a block of color*
2) Move over the width of ^ and repeat until the whole row is filled.
3) Move down the maximum height in ^ row and repeat until max height is filled.

So now you have a file that when converted back would be a lattice of colorblocks and holes. Now, however, we can start systematically filling in the holes with your previously used method.

4) Print a code to show that the end of blockcoding has been reached
5) Find first hole and print out line encoding
6) Do the same for all remaining holes

And just as the encoding program is able to figure out where the holes are after the blocks are created, the decoding algorithm can do the very same. This will be more memory intensive, but should save much more space.

Now, to make this better, you could limit the maximum size of each block. this way, no supertall blocks force the rest of the code to be written the old way. You would also want to run size checks from all four directions and not just two, in order to optimize, again.


*Also i was bored so I wrote a possible blockmaking code. Edit my post in order to see that it tually does have decent spacing and such.

x = 0;
y = 0;
i = 0;

while (true) {
//Gather Data
t = 1;
n = 0;
a = 0;
while (true) {
while (true) {
if (c[x,y]==c[x+t,y+n]) {
a = 1;
tw++;
if (x+tw > maxwidth) {
a = 0;
tw = maxwidth-x;
break;
}
} else {
tw--;
if (a==1) {
a = 0;
break;
}
if (tw<0) {
a = 0;
break;
}
}
}
if (t<0) {
m=n;
break;
)
t[n] = t;
n++;
}

//Find 'Optimum' Rectangle
n = 0;
r = 0;
while (m>n) {
if (t[r]*r<t[n]*n) {
r = n;
}
n ++
}

//output the characteristics of block as a datastructure
p = DataPelletConstruct(c[x,y],t[r],r);
i++;

//move over to the next item
x += t[r];
if (x>maxwidth) {
break;
}
}