[08:27] Join: Mizcu joined #corewars [09:25] Join: datagramc joined #corewars [09:25] bvowk, I need your help [09:25] Around? [09:27] hi Data [11:31] MSG: Quit: Leaving [13:38] Join: willvarfa joined #corewars [13:50] Join: Metcalf joined #corewars [13:50] Hi [13:50] Hi John [13:50] had a good christmas? [13:50] Yes thanks Will. How was yours? [13:50] I received a huge bean-bag and the Matrix DVDs from my girlfriend [13:52] Join: Roy joined #corewars [13:54] Girlfriend? The one with with the redcode tatoo? [13:54] hello Roy [13:55] Hi all [13:56] Hi Roy [13:56] Will: no, I let her off [13:59] * willvarfa got socks etc [13:59] :-/ [13:59] and a Su Doku book from a friend in Blighty [13:59] quite addictive :-~ [14:00] hence on the computer making a Su Doku solver.. [14:00] Yeah, Sudoku's are nice :) [14:00] hadn't seen them before [14:00] No? Every newspaper here has them [14:00] but even grandma here knew about them, so they must be the new craze :-) [14:01] I made a Su Doku creator [14:01] I am thinking about submitting them to local papers to make a little bit of extra cash [14:02] Heh, nice [14:02] On Christmas day, there were 9 of us. At some point during the day we all solved a Su Doku [14:02] There is a little electronic Su Doku game with LCD display [14:03] There is also a Su Doku cube, just like a Rubik's Cube [14:03] I might attempt a Su Doku solver in Redcode, if it can be done in 500 lines [14:04] Heh.. [14:05] Does it pay to send them sudoku's? thats odd...there are numerous sudoku-creators online :S [14:06] The creators online don't give the Su Doku a rating and play through it [14:07] I've made some other Su Dokus anyway [14:07] 4 x 4 and 6 x 6 [14:07] Nice, so that works too... (cool) [14:08] Okay, mini Su Doku challenge: [14:08] a sudoku solver in redcode - now that sounds like a good challenge [14:08] Ready [14:09] lol [14:09] Steady... [14:09] Go: [14:09] .. 3. [14:09] 1. .. [14:09] .. .3 [14:09] .2 .. [14:09] only one of each number 1-4 in each row, column or 2x2 square [14:11] 24 31 [14:11] 13 42 [14:11] 41 23 [14:11] 32 14 [14:12] Will first with the reply in /msg Roy, sorry :-) [14:12] Heh, I was playing minesweeper, so I didn't notice it so soon, do another ;) [14:13] I haven't actually got any with me, but I'll do one tomorrow or Thursday. [14:13] Maybe a 6x6 which should take 5 minutes to solve :-) [14:13] Ok, lets go :) [14:13] Ohw, you don't have one [14:20] Okay, would you like another 4x4? [14:20] Sure [14:21] Are you ready too Will? [14:21] Now you ask.. :-P [14:23] * Metcalf thinks Will is afk [14:24] Probably making a redcode solver ;-) [14:24] oops sorry [14:24] back [14:24] :-) [14:24] Shoot..! [14:24] Ready Will, another 4x4 [14:24] yeap!!!! [14:24] .. .. [14:24] 3. 4. [14:24] [14:24] .2 .3 [14:24] .. .. [14:24] Go, go, go! [14:26] Will is first, approximately 80 seconds :-) [14:26] (grrrr) [14:26] Lost by a typo :( [14:27] * willvarfa wonders what the 6x6 look like [14:27] There aren't many variations on a 4x4 grid, but I'll bring one of my 6x6 in tomorrow [14:28] ..3 2.. [14:28] it is divided into 6 3x2 rectangles instead of 9 3x3 squares [14:28] 2.4 .1. [14:28] 3.. 1.. [14:28] ..1 ..6 [14:28] .3. 4.1 [14:28] ..2 3.. [14:28] go! [14:30] Hmmm... tricky [14:31] The website said it was a easy one :) [14:31] :-) [14:31] This is the hard version: [14:31] . . . | . . . [14:31] . 6 2 | 3 4 . [14:31] ------------- [14:31] . 3 . | . 5 . [14:31] . 2 . | . 1 . [14:31] ------------- [14:31] . 4 6 | 1 2 . [14:31] . . . | . . . [14:32] Btw. I don't have the solution, and can't be bothered to make one ;-) [14:33] :-( [14:33] But JM solved it already [14:33] 4 minutes ;-) [14:33] And if will does too I can compare ;-) [14:35] which one? [14:35] The first [14:35] oops started on the second [14:39] hmm it is tricky :-/ [14:39] 4 mins for the first, 7 mins for the second [14:41] better than me :-/ [14:42] You just need to solve a few puzzles and you'll soon pick up speed. [14:42] I've only done about 15 or 20 before [14:43] ah shucks I give up on that second [14:43] I can't do it in a respectable time :-( [14:43] :-( [15:00] ah time to go eat [15:00] * willvarfa waves [15:00] MSG: Quit: Chatzilla 0.9.68.5.1 [Firefox 1.5/undefined] [15:00] * Metcalf waves [15:01] I got my website in a U.K. Internet magazine by the way. [15:01] My traffic has tripled [15:06] Nice! [15:06] :-) [15:06] Why did you send it? [15:06] A bit of free publicity for Corewar [15:06] It is a reader's webpage section. [15:07] I've sent stuff to other magazines recently too [15:07] Hehe nice [15:07] Hopefully more people soon [15:08] I hope so [15:08] The screenshot was of the main page [15:10] Do you keep track of the amount of visitors? [15:10] I have a log. [15:10] ip address, refering page and document requested [15:15] New Mesenne prime, I missed that :-( [15:16] Heh [15:16] How many do you have (+/-) [15:17] No, not my new prime [15:17] 2^30402457-1 [15:17] 9152052 digits! [15:17] So, the prize for a 10000000 digit prime is still up for grabs [15:18] Thats a lot :) but getting close [15:18] I have 49 primes. [15:18] How do they solve that, just starting a solvingprogramme I supose..? [15:19] If you want to search for primes, try Proth or newpgen and llr [15:19] Proth is here http://primes.utm.edu/programs/gallot/index.html [15:20] Download it, put in a range and wait. [15:21] Sounds easy enough.. [15:21] Isn't there a list online somewhere that rules out doubles (would be fun/good to have) [15:22] When it is downloaded and running, select Form k.2^n+1 [15:22] The top 5000 http://primes.utm.edu/primes/lists/all.txt [15:23] A reasonable range to search would be: n=230000 to 999999, k=2365 [15:23] And what would be a... [15:23] Very simple to set up [15:23] ok :) [15:24] I am searching k=1143, k=2667 and k=3039 at the moment [15:24] Heh impy [15:25] Don't bother searching with n lower than 215000 or you won't make the top 5000 [15:25] The bigger n gets, the larger the prime, the slower it gets. [15:26] On an average PC proth should give a prime on average every 2 weeks [15:26] and what does that k do? [15:26] k * 2 ^ n + 1 [15:27] It's the formula for the prime [15:27] ohw (duh) [15:28] One of my machines is currently searching for a prime which will get me inside the top 100 [15:29] But it will take about 10 months :-( [15:29] Heh, its also a bit of luck ofcourse [15:29] Yes :-) [15:29] I'll go and search k 2203, hopefully it'll get me something :) [15:30] Usually the higher K is, the less likely someone has searched it. [15:30] http://www.prothsearch.net/riesel.html [15:31] The link show how high everyone has searched for lower values of K [15:33] That Proth, it doesn't show much, how do I know what its doing? :) [15:33] I thought your birthday is 22 Feb Roy. [15:33] yeah, but it wouldn't take 2202 ;) [15:33] it made it 2203 :( [15:34] First it will say [15:34] 2667*2^220002 + 1 ? Trial division up to 6050055000 [15:34] or something similar [15:34] yup [15:34] Then after trial division, it will say [15:34] 2667*2^220002 + 1 ? Computing power [9.61%] [15:34] or something similar [15:35] and if you would like to test it, try a lower range for n [15:35] for example n=20 to 10000 and watch it whiz through lots of smaller primes [15:37] Ok, its working, now I'll let it rest/calculate for a couple of weeks (or something) [15:37] :-) [15:38] And when is the moment I scream and shout eureka? [15:40] If it finds a prime, it will tell you about it in proth.txt [15:40] MSG: [15:41] Heh, it found 5 small ones (with the tests) [15:41] :-) [15:41] 2409*2^238+1 [15:41] 2409*2^417+1 [15:41] 2409*2^582+1 [15:41] 2409*2^594+1 [15:41] 2409*2^701+1 [15:42] 24-09 <- chose my girlfriend afterall, she might bring luck ;-) [15:43] :-) [15:45] 2667*2^3670+1 [15:45] 2667*2^3754+1 [15:45] 2667*2^4022+1 [15:45] I am still looking for a decent size corewar related prime however. [15:46] Join: fiveop joined #corewars [15:47] Hi Fiveop [15:47] hi [15:47] Topic Change: fiveop sets topic: www.koth.org - www.corewar.info - corewar.co.uk - Forget Newyear! Play Corewar! [15:51] What is a nice size to cheer about :)? [15:51] Big enough to enter the top 5000 [15:51] n > 215000 at the moment [15:51] And when do I cash in? :-) [15:51] When n > 10000000 [15:51] No smaller cash prices..? :( [15:52] No :-( [15:53] Join: Judodudo joined #corewars [15:53] What is so special about the Mersenne primes..? [15:53] Though if you write a prime finding program in Redcode capable of finding primes over 1000 digits in a reasonable time, I'll see what kind of prize I can come up with ;-) [15:53] Mersenne primes? [15:54] Mersenne primes are quicker to test than proth primes [15:54] Mersenne = 2^n-1 [15:54] proth = k*2^n+1 [15:54] llr = k*2^n-1 [15:54] Join: Fluffy joined #corewars [15:54] You'd have a bit of trouble to display the results in MARS of a prime generator [15:54] :) [15:55] However, the Mesenne numbers have been tested up to an extremely high value of N already [15:55] Yes i see how that would be faster [15:55] Hi Judodudo, hi Fluffy [15:55] How high? [15:55] Metcalf (a.o.) are trying to fix that with a Input and Output [15:55] hi [15:55] How is that going JM? [15:55] Hi Fluf+Judo [15:55] hi [15:55] Roy: under discussion :-) [15:55] hi fluff [15:56] * Fluffy won't move an inch today anymore! [15:56] Hi everybody! [15:56] Fluffy, not going to bed anymore? No more coffee? [15:56] What did you do? :-) [15:57] Coffee? I only take coffee under extreme circumstances [15:57] Okay, I have to go. Tonight I am visiting my aunty [15:57] * Fluffy waves to Metcalf [15:57] Good luck with the prime search Roy [15:57] Thanks, you too ;-) [15:57] * Roy waves [15:57] * Metcalf waves [15:58] It sounds like you are having a very extreme circumstance right there [15:58] No, but I can give you an example of extreme circumstances: [15:58] By the way, if anyone fancies joining a distributed search for primes with k=1143, k=2667, k=3039, etc I could organise something :-) [15:58] * Metcalf waves [15:58] MSG: Quit: mov.i #1,1 [15:59] Me not having slept for days and about to debug pMARS [15:59] * Roy would like that too... a CW-search party [15:59] Heh, Jens, you knew it would happen ;-) [15:59] what? [15:59] But you have a lightning fast mars now (for 88) without having to recompile it! [16:00] yes, 9.3 MIPS at the moment :) [16:00] almost as fmars [16:00] *almost as fast as fmars [16:00] Wow, you made it even faster! [16:01] You can now try to rewrite stuff from C to assembly to make it even faster heh [16:01] I want it be portable -> no asm [16:01] Maybe I'll write a special x86-asm version, but not in the near future [16:02] But its already very fast, did you do the koenigstuhl verification-test yet? [16:03] No, only the top-25 [16:04] I'm now working on the homepage for PyCorewar. [16:04] so the Mersenne Primes are the ones obtained by using the statement of the "kleiner Fermat"? [16:04] no idea... I'm new to primes [16:04] I really should publish it, because otherwise it will turn into vaporwar like the next Duke Nukem version ;-) [16:04] If you make a 94 version I'll use it!! [16:04] Fluffy: mathematische "Aussage" in english? [16:05] "Uitzicht in dutch?" [16:05] expression? [16:05] Roy: "kleiner Fermat" say's, if p is a prime, than (2^p)-1 is a prima [16:05] Fluffy: ... thanks :p [16:05] -a+e [16:05] Well, I think so then :) [16:06] Fluffy: in which laguage did you write your thesis? [16:13] MSG: Ping timeout: 252 seconds [16:31] why ae yu all looking for primes? [16:31] hmm [16:31] I appear to have lost the skill of spelling [16:33] Well, its fun :) [16:33] Metcalf can better explain it I think, he has found a couple, and has been doing it a bit longer then me (I started 2 hours ago heh) [16:35] MSG: Remote host closed the connection [17:19] MSG: [17:39] Join: Mizcu joined #corewars [18:49] Join: Roy joined #corewars [19:19] Join: Philb joined #corewars [19:19] hi Phil [19:19] Hi Mizcu [19:20] Lots of idle again, looks like I missed a bunch earlier [19:22] * Philb waves [19:22] Part: Philb left #corewars [21:19] hrm. [21:42] MSG: [21:50] Join: Neogryzor joined #corewars [21:52] bur, bur [21:55] Fluffy: My winzip reports an error when trying to open yap surface's raw data files :/ [22:01] "error reading header..", gree [22:01] grr [22:03] hrm. [22:05] hi bvowk [22:05] hello [22:05] How was Xmas? [22:07] (damn winzip) [22:14] hum, gotta go [22:15] bye [22:15] MSG: Quit: Physical Wreck IRC webscript: http://www.pswclan.com/cgi-bin/irc/irc.cgi [EOF] [22:19] Anybody here? [22:22] not really [22:22] how goes? [22:23] Fine, you? had a nice christmas? [22:23] as nice as xmas can be I guess [22:24] Heh, sounds ok then [22:24] I've just started to hunt for primes, but I'm impacient, I guess those things don't match [22:34] heh [22:34] no.. [22:34] they really don't [22:35] unless you've got big swaths of computrons [22:44] You have...! [22:44] (right?) [23:19] heh [23:19] not that much :) [23:19] if you're looking for big primes.. :) [23:23] A big bit of it is jst luck.. [23:23] yeah.. [23:23] but to get "lucky" you'll need to do alot of primes :) [23:24] Thats true, but its worth trying anyway [23:28] Gotta go, ciao! [23:28] MSG: [23:37] Join: Neutrino joined #corewars [23:37] hi [23:52] hello [23:52] I'm not really here.. [23:57] heh [23:58] * Neutrino thinks he's Fizmo [23:59] * Neutrino and Fizmo greets the cw community from Berlin CCC congress