Hi... I'm new to this board, so let me introduce myself. My name is Mark, and I'm a network administrator/web designer. I also do some programming, and have...
Hi again... Here's the compression/searching method I used for my Boggle solver program. I'd be very interested to hear about other ways that people have...
I have a Java app I wrote for this (also for Boggle) that makes a tree like you've described (a DAWG) and then finds all identical subtrees and relinks all...
... I also use (for a cryptogram solver) a trie (I would not call it a DAWG, that describes a specific representation of a trie). But instead of using 26 bits...
David Eppstein
eppstein@...
Sep 17, 2002 12:28 am
470
... I've written something similar, but in C++, and it only takes 2 seconds to build a tree with it... (from a sorted 248519 word list) It uses a data...
Falk Hueffner
falk.hueffner@...
Sep 17, 2002 10:13 am
471
In my 1994 paper (S.A. Gordon, A faster Scrabble move generation algorithm, Software Practice and Experience 24 (2) (1994) 219-232.), I presented a ...
Steven Gordon
sagordon2@...
Sep 17, 2002 12:08 pm
472
... If you were cramped for memory, looks like you could cram the whole thing into 4 bytes (32 bits)... At a minimum you could mix the two booleans into the...
John Babina
john@...
Sep 17, 2002 1:38 pm
473
... Uhm, 8 + 22 + 1 + 1 = 32... so it is exactly 4 bytes. BTW, this layout isn't really my idea, I found it somewhere else, but I don't remember where... :( --...
Falk Hueffner
falk.hueffner@...
Sep 17, 2002 1:41 pm
474
... thing ... Yes, I was well aware that 8 + 22 + 1 + 1 = 32, that is why I suggested it. What I was referring to is that depending on your compiler or options...
John Babina
john@...
Sep 17, 2002 1:46 pm
475
... Really?! Which compilers do that? John -- John Chew (poslfit on MD/WD/PD) jjchew@... * http://www.math.utoronto.ca/jjchew...
... Graham Toal presented a nice portable version of DAWG construction and printing etc. a long time ago (http://www.gtoal.com/wordgames/dawgutils/). He used 4...
Laeuter
laeuter@...
Sep 17, 2002 2:09 pm
477
... I've written several versions of my lexicon data structure. The move generation algorithm is Steve Gordon's and I use his GADDAG, but the method of which...
... I don't suppose anybody's done this in perl? I've been thinking of putting up a website using CGIs to allow Crosswords (my PalmOS Scrabble-like game)...
Perl is amazingly fast at most things except for dealing with C pointer like functions.... IE: efficiently solving a Boggle grid or simulating a Scrabble ...
John Babina
john@...
Sep 17, 2002 4:38 pm
480
Do you optimize the tree at all? 2 seconds is not much CPU to analyze and optimize a 248,000 entry word list! My code can build the initial tree in just a few...
... Yes, otherwise the tree would be larger than the word list... I've put the source at http://people.debian.org/~falk/dawg.tar.gz. It exploits the fact that...
Falk Hueffner
falk.hueffner@...
Sep 17, 2002 6:36 pm
482
Feh! I said it before, and I'll say it again. Youse guys are all using the wrong language. For heavy tree-oriented, variable-length string-oriented,...
Is there any publically available program that takes, as input, a board, rack, and lexicon, spits out all moves possible? I'm sure it wouldn't be hard to...
... Some years ago when I started coding A&J's algorithm for Crosswords (my PalmOS scrabble-like game) I had a conversation with one of the authors (Jacobsen,...
Please see my new freeware "scribble" game at www.ianford.com/scribble . It has a pretty fast robot opponent, and is convenient (not so much dragging of tiles...
re: scribble, at www.ianford.com/scribble I haven't put in much strategy, mainly because it can beat me consistently without strategy. The insight that I had...
Hs anyone here written code to do the following: sequentially read a file of text for every character you read, start a DAWG traversal every time you hit the...
Have not written anything similar to that, however have you looked into using PERL for your spam detection? PERL is highly suited for string manipulation and...
John Babina
john@...
Oct 22, 2002 5:44 pm
495
... Nope, I've written those - they're easy! You simply extract one word at a time from the source text and look it up in a dawg. The words are deliited and...
... Ah - OK - I didn't mention your name because you sent the remark to me in private mail rather than to the group, but I wanted to answer the point in ...
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.
