Hints

On April 30 2010 15:51 motbob wrote:
hint: there are still a bajillion combinations that those keys could be.

On April 30 2010 16:00 Ankalagon wrote:
x + 17 = x

Charlie, should you solve this, I will accept your beta key with dignity.

On April 30 2010 16:02 CharlieMurphy wrote:
ok here is a really big clue: There is only 1 sequence in the correct position in the first code, and 2 are in the correct position in the second code.

On April 30 2010 16:36 rotinegg wrote:
i was trying out different keys and missed the BETA KEY INSIDE thread -_-

On April 30 2010 16:38 Hyde wrote:

Didn't you get one earlier today anyway?

On April 30 2010 18:02 rotinegg wrote:
WOW AFTER ALL THAT SEARCHING JV9EPE-WBH7-JBGYJZ-D6KD-X4WDWZ AND MPR7MX-WR8E-H764TR-EH7Y-FXWFGX ARE ALREADY CLAIMED FML IM GOING TO SLEEP T_T

On April 30 2010 18:07 Ivs wrote:
Yeah I got one of them, not sure who has the other though.

On April 30 2010 18:05 inlagdsil wrote:

Wait, you found them?

On April 30 2010 18:11 inlagdsil wrote:

Can you post the one you found?

EDIT: btw congratulations!!

On April 30 2010 18:01 Nytefish wrote:
You really shouldn't make something like this if you have a poor understanding of combinatorics.

On April 30 2010 18:00 inlagdsil wrote:
I'm finally done the program that finds every single possible key!
It's already 5 AM, so tomorrow if I have time I will modify it to apply the hints. Right now, none of the hints are taken into account.
Here it is, written in matlab, for anyone who cares:

[spoiler]
clear all;clc;
A=['RXWFGX' 'X4WDWZ' 'JBGYJZ' 'HV9EPE' 'YPR7MX' 'H764TR'];
B=['WR8E' 'WBH7' 'EH7Y' 'D6KD'];
g=int16(4);h=int16(6);
CC=int16(1);C=CC;
M=int16(zeros(24,4));N=int16(zeros(720,6));
for a=int16(1):h 
	b=int16(1);
	while (b<=h)
		while (b==a)
			b=b+1;
		end
		c=int16(1);
		while (c<=h)
			while (c==b) || (c==a)
				c=c+1;
			end
			d=int16(1);	
			while (d<=h)
				while (d==a) || (d==b) || (d==c)
					d=d+1;
				end
				e=int16(1);
				while (e<=h)
					while (e==a) || (e==b) || (e==c) || (e==d)
						e=e+1;
					end
					f=int16(1);
					while (f<h)
						while (f==a) || (f==b) || (f==c) || (f==d) || (f==e)
							f=f+1;
						end
						if b>h || c>h || d>h || e>h || f>h
							break
						end
						N(CC,:)=[a b c d e f];
						f=f+1;CC=CC+1;
					end
					e=e+1;
				end
				d=d+1;
			end
			c=c+1;
		end
		b=b+1;
	end
end
for m=int16(1):g 
	n=int16(1);
	while (n<=g)
		while (n==m)
			n=n+1;
		end
		o=int16(1);
		while (o<=g)
			while (o==m) || (o==n)
				o=o+1;
			end
			p=int16(1);
			while (p<g)
				while (p==n) || (p==m) || (p==o)
					p=p+1;
				end
				if p>g || n>g || o>g
					break
				end
				M(C,:)=[m n o p];
				p=p+1;C=C+1;
			end
			o=o+1;
		end
		n=n+1;
	end
end
filename='betakey.txt';
fid = fopen(filename, 'w');
for i=1:24
	for j=1:720
		a=(N(j,1)*6-5);b=(N(j,2)*6-5);c=(N(j,3)*6-5);d=(N(j,4)*6-5);e=(N(j,5)*6-5);f=(N(j,6)*6-5);
		m=(M(i,1)*4-3);n=(M(i,2)*4-3);o=(M(i,3)*4-3);p=(M(i,4)*4-3);
		K1(1,:)=[A(a:a+5) B(m:m+3) A(b:b+5) B(n:n+3) A(c:c+5)];
		K2(1,:)=[A(d:d+5) B(o:o+3) A(e:e+5) B(p:p+3) A(f:f+5)];
		fprintf(fid,'K1: %s\r\n',K1);
		fprintf(fid,'K2: %s\r\n\r\n',K2);
	end
end
fclose(fid);
%inlagdsil, April 30 2010
[/spoiler]

You are welcome to use this to help you find the keys, on condition that you share one with me!

EDIT: TL formatting got rid of tabs and added smileys!
Considering how many more hints there are now than when I first started, this program seems kind of superfluous...

On April 30 2010 18:31 inlagdsil wrote:

On the contrary, the fact that I am bad at combinatorics made this really interesting to try. Even though the program is inefficient, it works perfectly.

On April 30 2010 18:45 Nytefish wrote:


Oh I was talking about the contest. I was also referring to how the "riddle" was originally posed.