Quantcast

Maximum PC

It is currently Fri Dec 19, 2014 7:58 pm

All times are UTC - 8 hours




Post new topic Reply to topic  [ 1 post ] 
Author Message
 Post subject: Project Euler - Problem 391
PostPosted: Wed Sep 26, 2012 12:28 pm 
Bitchin' Fast 3D Z8000*
Bitchin' Fast 3D Z8000*
User avatar

Joined: Tue Jun 29, 2004 11:32 pm
Posts: 2555
Location: Somewhere between compilation and linking
Against my better judgement, the other day I decided to take another bite out of the Project Euler apple and began working on Problem 391. I say against my better judgement because I'm stuck and desperately want to solve this damn problem! It didn't take long for me to find a O(n) solution that correctly solves the example of M(20), but unfortunately, it is nowhere near fast enough to solve a graph with 2^10000 nodes (or even 2^100, not that it matters). Not to mention the 2^9,999, 2^9,998, ... 2^1 other graphs that have to be solved. Yes, those stinking mathematicians have found one of those things they call a pattern (or series).

Anyways, I just wanted to wanted to see if anyone else is either working or interested in working on this problem. I've very curious to discover what method(s) they've used to cut such an enormous problem space down to size.

Image

PS - Maybe I'm losing my memory, but I would swear that people were using signatures recently, no?


Top
  Profile  
 
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 1 post ] 

All times are UTC - 8 hours


Who is online

Users browsing this forum: No registered users and 3 guests


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 post attachments in this forum

Search for:
Jump to:  
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group

© 2014 Future US, Inc. All rights reserved.