Return to Unfiction unforum
 a.r.g.b.b 
FAQ FAQ   Search Search 
 
Welcome!
New users, PLEASE read these forum guidelines. New posters, SEARCH before posting and read these rules before posting your killer new campaign. New players may also wish to peruse the ARG Player Tutorial.

All users must abide by the Terms of Service.
Website Restoration Project
This archiving project is a collaboration between Unfiction and Sean Stacey (SpaceBass), Brian Enigma (BrianEnigma), and Laura E. Hall (lehall) with
the Center for Immersive Arts.
Announcements
This is a static snapshot of the
Unfiction forums, as of
July 23, 2017.
This site is intended as an archive to chronicle the history of Alternate Reality Games.
  

The time now is Wed Nov 20, 2024 1:24 am
All times are UTC - 4 (DST in action)		 View posts in this forum since last visit
View unanswered posts in this forum
Calendar
 Forum index » Archive » Archive: General » Old News & Rumors
[Trailhead] Rewriting The Future
View previous topicView next topic
Page 14 of 26 [376 Posts]   Goto page: Previous 1, 2, 3, ..., 12, 13, 14, 15, 16, ..., 24, 25, 26  Next
Author Message
ads123
Veteran

Joined: 12 Nov 2012
Posts: 85
MyrkVandr wrote:
Edit: I think I may ask him if he could complete the face development challenge for us so we can get someone on the inside perhaps.


That's exactly what I was thinking. Since, most of us are stuck on that ask him if he has any hints/tips or could he ... y'know *cough* do all the work for us *cough*.

PostPosted: Thu Jun 20, 2013 1:11 pm
 View user's profile
 Back to top 
Arenhart
Boot

Joined: 13 Jun 2013
Posts: 33

 		Silly puzzle, Mehetabel is right, it's the shortest path, the problem is, the solution is not unique, so you must find the other path adding to 80 that they want...

I spent some time looking for the shortest path that goes through all the nodes, which does have an unique solution, only to find out it was simpler, and a bit more arbitrary...

Well, next puzzle then, someone already posted the right answer in the blog

PostPosted: Thu Jun 20, 2013 2:19 pm
 View user's profile
 Back to top 
AUZ505
Unfictologist


Joined: 07 Mar 2008
Posts: 1599
Location: Germany
Arenhart wrote:
Silly puzzle, Mehetabel is right, it's the shortest path, the problem is, the solution is not unique, so you must find the other path adding to 80 that they want...


The solution is unique - there is only one shortest path leading to the solution I posted.
edit: Mehetabel's path sums up to 81!

Regarding the "curve text". I guess it is a adjacency matrix leading to the following graph (as long I did not made a mistake). The next url should start with a "d". No idea where to go from here.

EDIT: I left out the vertices from a node to itself (A-A, B-B, ....). Not sure if this is relevant.
curvetextgrapgh.jpg
 Description   
 Filesize   27.14KB
 Viewed   50 Time(s)

curvetextgrapgh.jpg
_________________
Playing:

PostPosted: Thu Jun 20, 2013 2:30 pm
 View user's profile
 Back to top 
Arenhart
Boot

Joined: 13 Jun 2013
Posts: 33
AUZ505 wrote:

The solution is unique - there is only one shortest path leading to the solution I posted.


Well, it looks like it's silly me, then.

AUZ505 wrote:


EDIT: I left out the vertices from a node to itself (A-A, B-B, ....). Not sure if this is relevant.


Nice one, the connection seems to make a lot of sense.

Now that is a nice looking graph. Did you use any program to create it?

Anyway, how could the huffman tree relate to that? We can use the tree to decode a binary text, perhpas there are more parts to this puzzle?

EDIT: could this have anything to do with elliptic curve cryptography?

PostPosted: Thu Jun 20, 2013 3:38 pm
Last edited by Arenhart on Fri Jun 21, 2013 10:53 pm; edited 1 time in total
 View user's profile
 Back to top 
AUZ505
Unfictologist


Joined: 07 Mar 2008
Posts: 1599
Location: Germany
Arenhart wrote:

Did you use any program to create it?


No. I just connected the letters which had a "1" in the matrix.
_________________
Playing:

PostPosted: Thu Jun 20, 2013 3:57 pm
 View user's profile
 Back to top 
amandel
I Have 100 Cats and Smell of Wee


Joined: 15 Jan 2008
Posts: 4096
Location: Nederland

 		Cheers AUZ Very Happy Since "curve text" anagrams to "cut vertex" (aka articulation point) I've been using AUZ's well-thought adjacency graph above to isolate those points.

My points/path led to an incorrect html; am boarding a plane soon; so am HTH someone else further on the page AUZ found using the dutchman Wink Dijkstra algorithm
_________________
"I could write a hell of a paper on a grown man who dresses like a flying rodent."
"Can you hook up with a Snow Person? Can't tell you or I'd have to marry you."

PostPosted: Fri Jun 21, 2013 8:35 am
 View user's profile Visit poster's website Yahoo Messenger
 Back to top 
Arenhart
Boot

Joined: 13 Jun 2013
Posts: 33
amandel wrote:
Cheers AUZ Very Happy Since "curve text" anagrams to "cut vertex" (aka articulation point) I've been using AUZ's well-thought adjacency graph above to isolate those points.

My points/path led to an incorrect html; am boarding a plane soon; so am HTH someone else further on the page AUZ found using the dutchman Wink Dijkstra algorithm


Nice work Amandel, you actually got it right, you just had to

Spoiler (Rollover to View):
sort them alfabetically.


Here is the url it leads to:

Spoiler (Rollover to View):
[url] http://stoptoilworndiamond.co.nf/thighsprang/DHIJLNRU.html [/url]


Checking the new page, I think now we have a traveling salesman problem http://en.wikipedia.org/wiki/Travelling_salesman_problem, it involves starting and ending in the same point A, and there is a distance between each node in the graph

PostPosted: Fri Jun 21, 2013 9:57 am
 View user's profile
 Back to top 
amandel
I Have 100 Cats and Smell of Wee


Joined: 15 Jan 2008
Posts: 4096
Location: Nederland

 		Mega Props to you, Arenhart! Told Beth of your success while I try to take small comfort that my logic wasn't too Fuzzy & for once an anagram here was truly useful. Laughing
_________________
"I could write a hell of a paper on a grown man who dresses like a flying rodent."
"Can you hook up with a Snow Person? Can't tell you or I'd have to marry you."

PostPosted: Fri Jun 21, 2013 11:37 am
 View user's profile Visit poster's website Yahoo Messenger
 Back to top 
AUZ505
Unfictologist


Joined: 07 Mar 2008
Posts: 1599
Location: Germany

 		The new page looks like travelling salesman, indeed.
Unfortunately this is a NP-hard problem. Doing it brute force would mean testing all possible permutations, which are almost 500.000.000 different pathes. Just generating the permutations would take some amount of computing time. Sad
_________________
Playing:

PostPosted: Fri Jun 21, 2013 6:58 pm
 View user's profile
 Back to top 
booba
Unfictologist


Joined: 09 Mar 2007
Posts: 1433

 		Auz, Amandel, Arenhart-
I can sum up my admiration in two words. Wow!

PostPosted: Fri Jun 21, 2013 8:40 pm
 View user's profile
 Back to top 
Arenhart
Boot

Joined: 13 Jun 2013
Posts: 33
AUZ505 wrote:
The new page looks like travelling salesman, indeed.
Unfortunately this is a NP-hard problem. Doing it brute force would mean testing all possible permutations, which are almost 500.000.000 different pathes. Just generating the permutations would take some amount of computing time. Sad


Actually, 39.916.800 paths (first and last are always A, so a a permutation of eleven = 11!)

But I did find an algorithm that reduces the computing time from O(n!) to O(n^2*2^n), which is quite acceptable, Ill post a link here, it's one of the last items. [url] http://www.lsi.upc.edu/~mjserna/docencia/algofib/P07/dynprog.pdf [/url] You might notice, though, that this particular pseudocode described will calculate the distance of the shortest tour, but actually fail to return the actual route Shocked Not very usefull for our poor saleperson. I should finish an implemetation of the algorithm (that does return the path) soon, if this is the answer, we'll crack this in no time.

PostPosted: Fri Jun 21, 2013 9:47 pm
 View user's profile
 Back to top 
Arenhart
Boot

Joined: 13 Jun 2013
Posts: 33
booba wrote:
Auz, Amandel, Arenhart-
I can sum up my admiration in two words. Wow!


Triple A team Very Happy But we are all together here. I'm sure some more riddle-like puzzles are bound to pop up soon

PostPosted: Fri Jun 21, 2013 9:49 pm
 View user's profile
 Back to top 
Arenhart
Boot

Joined: 13 Jun 2013
Posts: 33

 		OK, I got it, it was just a matter of implementing the algorithm.

Below is the code, though it will not work in codeskulptor becouse of a time limit for running scripts... But anyone can check it if brave enough to face my terrible organization and absolute lack of comments, here it is:

[url] http://www.codeskulptor.org/#user16_q15QKNqT3i_6.py [/url]

You should be able to put it to run if you have python 2.7 in your PC, just paste and copy,

I had found a program to solve the TSP, but it was not optimum, so it wouldn't give our answer, link follows, if anyone is curious http://tspsg.info/en/support

Anyway, lets go to the linked page!
Spoiler (Rollover to View):
http://stoptoilworndiamond.co.nf/thighsprang/AHJLBKEGDFICA.html


Anyway, looks like we finally got to the message! Feels like we were wading our way through a graph ourselves... We are finally going to put that tree to use, it seems.

PostPosted: Fri Jun 21, 2013 10:50 pm
 View user's profile
 Back to top 
Arenhart
Boot

Joined: 13 Jun 2013
Posts: 33

 		Got it.

Spoiler (Rollover to View):

CREATING A PROFILE OF PEOPLE WAS JUST THE BEGINNING. THE REAL GOAL OF TOILWORN DIAMOND WAS TO CONTROL ALL THINGS PEOPLE WERE ABLE TO SEE ON A COMPUTER SCREEN. IN 2010, THEY FINALLY COMPLETED THEIR AMBITIOUS MISSION TO BUILD A MICROCHIP THAT COULD CONTROL ALL DATA THAT WAS TRANSMITTED THOUGH IT. THE FRUIT OF THEIR LONG TOIL WITH THE PROJECT, WAS FINALLY PALPABLE WHEN THEY HAD THE TOILWORN DIAMOND CHIP, OR ''TDCHIP'' AS THEY CALLED IT, IN THEIR HANDS. THE FUNCTIONING OF THE CHIP WAS FAIRLY SIMPLE, YET IT POSSESSED TREMENDOUS POWER. THE CHIP WOULD CONTACT THE AVECIRA'S USER REGISTER AND ASK FOR AN EVALUATION OF THAT USER'S PREFERENCES. BASED ON THAT, THE CHIP WOULD EITHER SHOW THE USER THE DATA OR CENSOR IT AS IRRELEVANT. AT THAT TIME, THE CHIP SEEMED TO WORK WELL. PEOPLE WERE SEEING THINGS THAT THEY WERE INTERESTED IN, AND NEVER SAW THE CENSORED INFORMATION THAT THEY WEREN'T INTERESTED ANYWAY. RICHARD DIDN'T SEE ANY RISKS IN THE BEHAVIOR OF TDCHIP AND WAS EAGER TO GET IT INSTALLED IN ALL POSSIBLE DEVICES. REMEMBER THE FOLLOWING WORDS, THEY MIGHT BECOME HANDY LATER. ''THEYCAN''


Also, this is in the source code: TS:2038-06-30-23-59-60


It was just a matter of deconstructing the huffingman's tree, this is the code I used to decypher the message, this one will actually work:

http://www.codeskulptor.org/#user16_Il6ryzSCUp2rOuk_0.py

Anyway, I guess this solves the mystery for now

This is the image of the tree with the related code for each character (probably yhe toughest thing was realizing one of the empty leaves was actually the space character). From the top down, every time the node split in two, I added a 1 for the left node and a 0 for the right node. This was actually reversed (it was 0 for the left node, and one for the right one), so in the code I reversed the 0's and 1's



PostPosted: Fri Jun 21, 2013 11:59 pm
 View user's profile
 Back to top 
amandel
I Have 100 Cats and Smell of Wee


Joined: 15 Jan 2008
Posts: 4096
Location: Nederland
I think John Allen Paulos first wrote:
There are only 10 types of people in the world: those who understand binary, and those who don't.


Then there's Arenhart (& AUZ also) who makes it 11 Laughing by creating his own code. Gave him Props at Beth's blog and my 'Charlie Brown' happiness is simply being able to grasp how he did this. THX to everyone who posted for making this puzzle such an interesting read for me at my yawn-fest symposium. (ETA: THEY CAN DIVE BUT...)
_________________
"I could write a hell of a paper on a grown man who dresses like a flying rodent."
"Can you hook up with a Snow Person? Can't tell you or I'd have to marry you."

PostPosted: Sat Jun 22, 2013 5:08 am
 View user's profile Visit poster's website Yahoo Messenger
 Back to top 
Display posts from previous:   Sort by:   
Page 14 of 26 [376 Posts]   Goto page: Previous 1, 2, 3, ..., 12, 13, 14, 15, 16, ..., 24, 25, 26  Next
View previous topicView next topic
 Forum index » Archive » Archive: General » Old News & Rumors
Jump to:  


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum



Powered by phpBB © 2001, 2005 phpBB Group