Greetings, I am following the algorithm mentioned here, http://www.gtoal.com/wordgames/wutka/dawg.html, to build a dawg structure. After inserting my...
... Not really. For example my version at http://people.debian.org/~falk/dawg.tar.gz takes 3 seconds for 248519 words on an 800MHz Alpha. It requires the...
Falk Hueffner
falk.hueffner@...
Jan 2, 2004 8:43 am
646
... My DAWG program makes the trie reduction in 2 seconds on a 1.3GHz Athlon. ... I guess that the lookslike method solves an isomorphism problem, right? You...
... I concur with the others; my JIT-compiled program takes ~20 seconds. ... Along with Gunnar's suggestion, changing the starting point of your reduction from...
Mine takes a similar amount of time -- roughly 15 minutes and 1.8GB of memory on a 1.4Ghz Opteron, but that's because I'm building a DAGGAD, which equates to...
... It should be possible to have both time and memory scale mostly linearly, for example my implementation takes about 1 minute and 64 MB memory for a 35MB...
Falk Hueffner
falk.hueffner@...
Jan 2, 2004 5:47 pm
650
My C program builds the suffix tree for 264,057 words in less than 2 seconds on my Mac laptop (800 MHz running at 667 on battery). Memory is about 25M. I have...
Hi: People with experience in Scrabble move generation (Brian, others?) please let us know: is there any noticable increase in move generation speed once you ...
... Yes, it should be identical. The only conceivable speedup could be from better paging characteristics, but with modern memory sizes that is not an issue. ...
OK nobody seems to be fielding this one, so even though I've never tested this, I'll describe the theory. The smaller your data structure, the more likely it...
Oh. I must've missed this thread. When using an Opteron with 1MB cache, I get a 40% increase in speed with the minimized trie. With a 256K cache Athlon, the...
Anyone care to comment on the assertion in "Storing and Retrieving Keys in a Table by Cross-Indexing" (~1992), <http://citeseer.nj.nec.com/41290.html>, by W....
Hi all, ... With one query you will find a set of indices of keys (disregarding the cost of the query). The cost of reconstruction -- and we want the resulting...
Martin Läuter
laeuter@...
Jan 30, 2004 9:22 am
657
[Non-text portions of this message have been removed]...
Hi all. I'm a newbie here, so please forgive the inevitable faux pas for the next little while. I've written a small (~10K source, ~6K compiled) C program to...
OK, here's faux pas #1: assuming that a reply to my own first message didn't get accepted and repeating it at the start of a new thread :) I got sick of...
Folks, some news! I received an email a couple of days ago from Rex Gooch who has been working on word squares. While looking up some of our old discussions ...
Any of you guys have easy access to a multi-processor system such as a grid or a loosely coupled array? I have a tensquare program running that looks like...
Hi, As far as I know, there are in existence 5 different sets of Boggle cubes that were used over the years. Is this correct? I've attached my five files...
Using the OSPD and the small Boggle grid (1993 version), the number of words of lengths 5 and up that appeared in 100,000,000 random shakes of the cubes: 5...
Using the OSPD and the small Boggle grid (1993 version), the number of words of lengths 5 and up that appeared in 100,000,000 random shakes of the cubes: 5...
Is there any endgame solving software out there that is freely distributed and will run on a PC, or that is web-based? I'm looking for something at least as...
... You mean this one? http://bigftp.ocsystems.com/sim.html Apart from that one I don't know of any either. Have you asked GVC if he could fix whatever the...
... http://www.davidst.com/attic/savant.zip Savant goes into endgame solving mode when set to level 20, its highest playing level. Was this the first or were...
Steven, ... Savant was published as LanWords back in 1992. It was a crossword puzzle game for Windows that featured configurable rules (so you can configure...
... I had some trouble unpacking it. WinXP's built-in zip says it is corrupt, but unix unzip coped with it fine. You wrote this in C? Do you still have the...
... This is curious. I checked it and you're right-- XP says it's corrupt. Then I downloaded it to my desktop and tried opening it with XP and it worked....
... Maven's first endgame player was in 1986. By 1990 it had evolved to the point where it outplayed human champions at tournament time controls. (Figure 1 ...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
