perch88's Code C*[3X3] = 28W ?

dava

The science doesn't  have news today, so do I, but if you need something interesting, I think I do have.

[ 本帖最后由 dava 于 2006-12-4 15:27 编辑 ]

FreddyMusic

perch88

I have not time to programme the code, but still interested in the game.
Probably, I cann't find a suitable glossary or dictionary, or you provide it ?

So the first version Algorithms is something like below.
It has the potential to opimize for better efficiency.

1. 
   
2. 
   
3. Start :
   
4. 
   
5. 1. Sequencly pick up a word from glossary , character string = Perch88 ( I assume, usually range A - Z )
   
6. 2. Check letter C is included in  the character string = Perch88 , if not go 1. if yes go 3
   
7. 3. Check all letter of character string are included in [ 3X3 ] letter Matrix , if not go 1. if yes go 4
   
8. 4. Print the Word, then go 1
   
9. 
   
10. End
    
11. 
    

复制代码

perch88

I think this could be another patent, but you don't have to implement it since we are playing with language
not necessary to spend a lot of time on that..

sapringna

原帖由 perch88 于 2006-12-4 03:05 发表


I didn't find comme in the dictionary. Is it a French word?

Sorry,comma

perch88

but you have an 'a' here
Never mind. Its over..

xiao9136

just for fun
expect for new games!

FreddyMusic

原帖由 perch88 于 2006/12/4 15:58 发表
I think this could be another patent, but you don't have to implement it since we are playing with language
not necessary to spend a lot of time on that..

Perch88,

Many Thanks, I like this Game, I have the feeling
This is moment we are coupling Computer language with a Nature language ?


Coz we don't have an available glossary so far.
So I am think to use another method to find the 28 words,
A new matrix is C*[O, E] * [S, H, D, N, E, R, M]
It has some logical from language viewpoint, isn't it ?

Or would you give me a short list of 18 avaible words,
so I can try with my previous patented Algorithm.


S  H  D  
O  C  N  
E  R  M

FreddyMusic

在 10 000 条，C 开头的单词中搜索满足条件的单词，得到如下结果。

用程序实现应该没有问题，我的算法可以在计算复杂性上更优化。

I have broken perch88's Code C*[3X3] = 28W ?

The answer: it is much more than 28 words.

GAME OVER

FreddyMusic

cede
censor
cheese
chemo
chessmen
choc
choose
chord
chore
chose
chosen
chrome
chromosome
coco
cocoon
cod
code
coerce
cohere
coherence
coho
come
commence
commend
commerce
commode
commodore
common
commonsense
con
concede
concern
conch
concord
condemn
condense
condescend
condo
condom
condone
condor
cone
consomme
consommé
coo
coon
cord
cordon
core
corm
corn
corrode
cosh
creche
crèche
credence
credo
creme
crescendo
crone
croon


http://www.simwe.com/forum/thread-783051-1-1.html

现有程序: 讨论如何优化代码，有关计算复杂性程序 ？

1. 
   
2. n = 10000
   
3. DictionaryLookup["c*", n];
   
4. New = DictionaryLookup["c*", n];
   
5. For[ i = 1, i < n,
   
6.   
   
7.   If[  
   
8.     Not[
   
9.      StringMatchQ[New[[i]], "*a*"]
   
10.       || StringMatchQ[New[[i]], "*b*"]
    
11.       || StringMatchQ[New[[i]], "*f*"]
    
12.       || StringMatchQ[New[[i]], "*g*"]
    
13.       || StringMatchQ[New[[i]], "*i*"]
    
14.       || StringMatchQ[New[[i]], "*j*"]
    
15.       || StringMatchQ[New[[i]], "*k*"]
    
16.       || StringMatchQ[New[[i]], "*l*"]
    
17.       || StringMatchQ[New[[i]], "*p*"]
    
18.       || StringMatchQ[New[[i]], "*q*"]
    
19.       || StringMatchQ[New[[i]], "*t*"]
    
20.       || StringMatchQ[New[[i]], "*u*"]
    
21.       || StringMatchQ[New[[i]], "*v*"]
    
22.       || StringMatchQ[New[[i]], "*w*"]
    
23.       || StringMatchQ[New[[i]], "*x*"]
    
24.       || StringMatchQ[New[[i]], "*y*"]
    
25.       || StringMatchQ[New[[i]], "*z*"]
    
26.       || StringMatchQ[New[[i]], "*s"]
    
27.       || StringMatchQ[New[[i]], "*ed"]
    
28.       || StringMatchQ[New[[i]], "*er"]
    
29.      ]
    
30.       , Print[New[[i]]]
    
31.     ]
    
32.    i++];

复制代码

[ 本帖最后由 FreddyMusic 于 2007-6-7 17:33 编辑 ]

pcqsl

I am late ... anybody mentioned:

scheme