Overclock.net - An Overclocking Community - Reply to Topic
Thread: Programming Challenges! Reply to Thread
Title:
Message:

Register Now

In order to be able to post messages on the Overclock.net - An Overclocking Community forums, you must first register.
Please enter your desired user name, your email address and other required details in the form below.
User Name:
If you do not want to register, fill this field only and the name will be used as user name for your post.
Password
Please enter a password for your user account. Note that passwords are case-sensitive.
Password:
Confirm Password:
Email Address
Please enter a valid email address for yourself.
Email Address:

Log-in


  Additional Options
Miscellaneous Options

  Topic Review (Newest First)
01-02-2009 04:13 PM
ToastedZergling I've moved on from this problem and into another! So if anyone wants to help me out / check out my progress thus far take a look here. It's all about optimization at this point.

Quote:
Originally Posted by ToastedZergling View Post
I have given the #10 Crackless Wall Puzzle using javascript, but I'm having a problem calculating the larger values. I can get up to W (18, 5) = 7958, but if I go much further up on the first parameter I get array out of bounds errors and other ugly messages. Does anyone think they could lend a spare set of eyes to see how I can improve this? I'm thinking I will have to modify the permute function, which I didn't write to begin with

=( Sad face at modifying other people's code, I like it when their work can just be a big black box.
12-31-2008 05:50 PM
ToastedZergling I have given the #10 Crackless Wall Puzzle using javascript, but I'm having a problem calculating the larger values. I can get up to W (18, 5) = 7958, but if I go much further up on the first parameter I get array out of bounds errors and other ugly messages. Does anyone think they could lend a spare set of eyes to see how I can improve this? I'm thinking I will have to modify the permute function, which I didn't write to begin with

=( Sad face at modifying other people's code, I like it when their work can just be a big black box.
12-29-2008 03:50 AM
arkheii Anyone looking for a good challenge may want to google for ACM programming competition questions.
12-29-2008 03:36 AM
metala
Quote:
Originally Posted by vaporvr6 View Post
i'm need a new challenge. anyone got something for me?
I have something for you.
"Elliptic curve cryptography"

* Generate keys
* Encode
* Decode

PS. I'm interested in it, but don't have the time to try. AFAIK this is one of the most secure asymmetric encryptions.

PS2. 112bit ECC has the security level of 2048bit RSA. (fixed)
12-28-2008 08:55 PM
vaporvr6 sorry, just read the first post. one should note that not every sodoku has a solution. i suppose it's reasonable to assume that every puzzle a book would give you has one, however. else it wouldnt be any fun.
12-28-2008 08:50 PM
vaporvr6 i'm need a new challenge. anyone got something for me?
12-26-2008 05:48 PM
mentholmoose Here's the roman numerals one, in PHP:

Code:

<?php

$handle = fopen("roman.txt", "r");
$numbers_file = fread($handle, filesize("roman.txt"));
fclose($handle);

$numbers_array = explode("\
", $numbers_file);

foreach($numbers_array as $number) {
$number = preg_replace("/[\
\ ]/", "", $number);
print($number . ": " . strlen($number) . " characters beforehand.\
");
$old = strlen($number);
$number = str_replace("IIIII", "V", $number);
$number = str_replace("IIII", "IV", $number);
$number = str_replace("VIV", "IX", $number);
$number = str_replace("VV", "X", $number);
$number = str_replace("XXXXX", "L", $number);
$number = str_replace("XXXX", "XL", $number);
$number = str_replace("LXL", "XC", $number);
$number = str_replace("LL", "C", $number);
$number = str_replace("CCCCC", "D", $number);
$number = str_replace("CCCC", "CD", $number);
$number = str_replace("DCD", "CM", $number);
$number = str_replace("DD", "M", $number);
print($number . ": ". strlen($number) . " characters afterward.\
");
print("There were " . ($old - strlen($number)) . " characters saved.\
\
");
}
?>
It's verified working with the txt you provided. I think there are a couple of small cases where it won't, but none in your example file.
12-19-2008 07:12 AM
Manyak
Quote:
Originally Posted by error10 View Post
Something that uses all 4 cores of my Q9550, probably.
lol ok yeah, there's always that
12-19-2008 07:07 AM
error10
Quote:
Originally Posted by Manyak View Post
Sure thing, if its better then why not?

Though I'm not sure how much faster you can get it, a good backtracking algorithm can do it in under 1s. I'd still like to see what you come up with though
Something that uses all 4 cores of my Q9550, probably.
12-19-2008 06:56 AM
Manyak
Quote:
Originally Posted by error10 View Post
Backtracking Sudoku looks interesting, though it hardly seems efficient. I could probably solve it by hand before the computer finishes. I think I'll try something else if you don't mind.
Sure thing, if its better then why not?

Though I'm not sure how much faster you can get it, a good backtracking algorithm can do it in under 1s. I'd still like to see what you come up with though
This thread has more than 10 replies. Click here to review the whole thread.

Posting Rules  
You may post new threads
You may post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off