-
Notifications
You must be signed in to change notification settings - Fork 0
/
run.py
1126 lines (955 loc) · 36.6 KB
/
run.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import random, re, time, string
from copy import copy as duplicate
# optional, speeds up by a factor of 4
#import psyco
#psyco.full()
DIR = "" #CHANGE TO LOCATION OF FOLDER
class Crossword(object):
def __init__(self, cols, rows, empty = '-', maxloops = 2000, available_words=[]):
self.cols = cols
self.rows = rows
self.empty = empty
self.maxloops = maxloops
self.available_words = available_words
self.randomize_word_list()
self.current_word_list = []
self.debug = 0
self.clear_grid()
def clear_grid(self): # initialize grid and fill with empty character
self.grid = []
for i in range(self.rows):
ea_row = []
for j in range(self.cols):
ea_row.append(self.empty)
self.grid.append(ea_row)
def randomize_word_list(self): # also resets words and sorts by length
temp_list = []
for word in self.available_words:
if isinstance(word, Word):
temp_list.append(Word(word.word, word.clue))
else:
temp_list.append(Word(word[0], word[1]))
random.shuffle(temp_list) # randomize word list
temp_list.sort(key=lambda i: len(i.word), reverse=True) # sort by length
self.available_words = temp_list
def compute_crossword(self, time_permitted = 1.00, spins=2):
time_permitted = float(time_permitted)
count = 0
copy = Crossword(self.cols, self.rows, self.empty, self.maxloops, self.available_words)
start_full = float(time.time())
while (float(time.time()) - start_full) < time_permitted or count == 0: # only run for x seconds
self.debug += 1
copy.current_word_list = []
copy.clear_grid()
copy.randomize_word_list()
x = 0
while x < spins: # spins; 2 seems to be plenty
for word in copy.available_words:
if word not in copy.current_word_list:
copy.fit_and_add(word)
x += 1
#print copy.solution()
#print len(copy.current_word_list), len(self.current_word_list), self.debug
# buffer the best crossword by comparing placed words
if len(copy.current_word_list) > len(self.current_word_list):
self.current_word_list = copy.current_word_list
self.grid = copy.grid
count += 1
return
def suggest_coord(self, word):
count = 0
coordlist = []
glc = -1
for given_letter in word.word: # cycle through letters in word
glc += 1
rowc = 0
for row in self.grid: # cycle through rows
rowc += 1
colc = 0
for cell in row: # cycle through letters in rows
colc += 1
if given_letter == cell: # check match letter in word to letters in row
try: # suggest vertical placement
if rowc - glc > 0: # make sure we're not suggesting a starting point off the grid
if ((rowc - glc) + word.length) <= self.rows: # make sure word doesn't go off of grid
coordlist.append([colc, rowc - glc, 1, colc + (rowc - glc), 0])
except: pass
try: # suggest horizontal placement
if colc - glc > 0: # make sure we're not suggesting a starting point off the grid
if ((colc - glc) + word.length) <= self.cols: # make sure word doesn't go off of grid
coordlist.append([colc - glc, rowc, 0, rowc + (colc - glc), 0])
except: pass
# example: coordlist[0] = [col, row, vertical, col + row, score]
#print word.word
#print coordlist
new_coordlist = self.sort_coordlist(coordlist, word)
#print new_coordlist
return new_coordlist
def sort_coordlist(self, coordlist, word): # give each coordinate a score, then sort
new_coordlist = []
for coord in coordlist:
col, row, vertical = coord[0], coord[1], coord[2]
coord[4] = self.check_fit_score(col, row, vertical, word) # checking scores
if coord[4]: # 0 scores are filtered
new_coordlist.append(coord)
random.shuffle(new_coordlist) # randomize coord list; why not?
new_coordlist.sort(key=lambda i: i[4], reverse=True) # put the best scores first
return new_coordlist
def fit_and_add(self, word): # doesn't really check fit except for the first word; otherwise just adds if score is good
fit = False
count = 0
coordlist = self.suggest_coord(word)
while not fit and count < self.maxloops:
if count == 1: # check top cell only on first letter
if not self.check_if_cell_clear(col, row-1):
return 0
if count == len(word.word): # check bottom cell only on last letter
if not self.check_if_cell_clear(col, row+1):
return 0
else: # else horizontal
# check surroundings
if active_cell != letter: # don't check surroundings if cross point
if not self.check_if_cell_clear(col, row-1): # check top cell
return 0
if not self.check_if_cell_clear(col, row+1): # check bottom cell
return 0
if count == 1: # check left cell only on first letter
if not self.check_if_cell_clear(col-1, row):
return 0
if count == len(word.word): # check right cell only on last letter
if not self.check_if_cell_clear(col+1, row):
return 0
self.grid[row-1][col-1] = value
def get_cell(self, col, row):
return self.grid[row-1][col-1]
def check_if_cell_clear(self, col, row):
try:
cell = self.get_cell(col, row)
if cell == self.empty:
return True
except IndexError:
pass
return False
def solution(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
outStr += '%s ' % c
outStr += '\n'
return outStr
def word_find(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
if c == self.empty:
outStr += '%s ' % string.lowercase[random.randint(0,len(string.lowercase)-1)]
else:
outStr += '%s ' % c
outStr += '\n'
return outStr
def order_number_words(self): # orders words and applies numbering system to them
self.current_word_list.sort(key=lambda i: (i.col + i.row))
count, icount = 1, 1
for word in self.current_word_list:
word.number = count
if icount < len(self.current_word_list):
if word.col == self.current_word_list[icount].col and word.row == self.current_word_list[icount].row:
pass
else:
count += 1
icount += 1
def display(self, order=True): # return (and order/number wordlist) the grid minus the words adding the numbers
outStr = ""
if order:
self.order_number_words()
copy = self
for word in self.current_word_list:
s = str(unichr(word.number+64))
copy.set_cell(word.col, word.row, '_')
x = 1
for r in range(copy.rows):
if(x<10):
outStr += str(x) + " "
else:
outStr += str(unichr(x-10+65)) + " "
x=x+1
for c in copy.grid[r]:
outStr += '%s ' % c
outStr += '\n'
outStr = re.sub(r'[a-z]', '_', outStr)
return outStr
def word_bank(self):
outStr = ''
temp_list = duplicate(self.current_word_list)
random.shuffle(temp_list) # randomize word list
for word in temp_list:
outStr += '%s\n' % word.word
return outStr
def legend(self): # must order first
outStr = ''
for word in self.current_word_list:
r = str(word.row)
c = str(word.col)
if word.row > 9:
r = str(unichr(word.row-10+65))
if word.col > 9:
c = str(unichr(word.col-10+65))
s = str(unichr(word.number+64))
outStr += '('+r+','+c+') %s: %s' % (word.down_across(), word.clue )
return outStr
class Word(object):
def __init__(self, word=None, clue=None):
self.word = re.sub(r'\s', '', word.lower())
self.clue = clue
self.length = len(self.word)
# the below are set when placed on board
self.row = None
self.col = None
self.vertical = None
self.number = None
def down_across(self): # return down or across
if self.vertical:
return 'down'
else:
return 'across'
def __repr__(self):
return self.word
### end class, start execution
#start_full = float(time.time())
#word = open("words20.txt", "r")
word = open("C:\\JavaPersonal\\UrbanGen\\src\\words20.txt", "r")
word_list = []
for line in word:
word_list.append(line.split('|'))
a = Crossword(13, 13, '+', 5000, word_list)
a.compute_crossword(2)
#print a.word_bank()
#print a.solution()
#print a.word_find()
#print " 1 2 3 4 5 6 7 8 9 A B C D"
print a.display()
print a.legend()
#print len(a.current_word_list), 'words used out of', len(word_list)
#print a.debug
#end_full = float(time.time())
#print end_full - start_full if vertical: # progress to next letter and position
row += 1
else: # else horizontal
col += 1
count += 1
return score
def set_word(self, col, row, vertical, word, force=False): # also adds word to word list
if force:
word.col = col
word.row = row
word.vertical = vertical
self.current_word_list.append(word)
for letter in word.word:
self.set_cell(col, row, letter)
if vertical:
row += 1
else:
col += 1
return
def set_cell(self, col, row, value):
self.grid[row-1][col-1] = value
def get_cell(self, col, row):
return self.grid[row-1][col-1]
def check_if_cell_clear(self, col, row):
try:
cell = self.get_cell(col, row)
if cell == self.empty:
return True
except IndexError:
pass
return False
def solution(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
outStr += '%s ' % c
outStr += '\n'
return outStr
def word_find(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
if c == self.empty:
outStr += '%s ' % string.lowercase[random.randint(0,len(string.lowercase)-1)]
else:
outStr += '%s ' % c
outStr += '\n'
return outStr
def order_number_words(self): # orders words and applies numbering system to them
self.current_word_list.sort(key=lambda i: (i.col + i.row))
count, icount = 1, 1
for word in self.current_word_list:
word.number = count
if icount < len(self.current_word_list):
if word.col == self.current_word_list[icount].col and word.row == self.current_word_list[icount].row:
pass
else:
count += 1
icount += 1
def display(self, order=True): # return (and order/number wordlist) the grid minus the words adding the numbers
outStr = ""
if order:
self.order_number_words()
copy = self
for word in self.current_word_list:
s = str(unichr(word.number+64))
copy.set_cell(word.col, word.row, '_')
x = 1
for r in range(copy.rows):
if(x<10):
outStr += str(x) + " "
else:
outStr += str(unichr(x-10+65)) + " "
x=x+1
for c in copy.grid[r]:
outStr += '%s ' % c
outStr += '\n'
outStr = re.sub(r'[a-z]', '_', outStr)
return outStr
def word_bank(self):
outStr = ''
temp_list = duplicate(self.current_word_list)
random.shuffle(temp_list) # randomize word list
for word in temp_list:
outStr += '%s\n' % word.word
return outStr
def legend(self): # must order first
outStr = ''
for word in self.current_word_list:
r = str(word.row)
c = str(word.col)
if word.row > 9:
r = str(unichr(word.row-10+65))
if word.col > 9:
c = str(unichr(word.col-10+65))
s = str(unichr(word.number+64))
outStr += '('+r+','+c+') %s: %s' % (word.down_across(), word.clue )
return outStr
class Word(object):
def __init__(self, word=None, clue=None):
self.word = re.sub(r'\s', '', word.lower())
self.clue = clue
self.length = len(self.word)
# the below are set when placed on board
self.row = None
self.col = None
self.vertical = None
self.number = None
def down_across(self): # return down or across
if self.vertical:
return 'down'
else:
return 'across'
def __repr__(self):
return self.word
### end class, start execution
#start_full = float(time.time())
#word = open("words20.txt", "r")
word = open("C:\\JavaPersonal\\UrbanGen\\src\\words20.txt", "r")
word_list = []
for line in word:
word_list.append(line.split('|'))
a = Crossword(13, 13, '+', 5000, word_list)
a.compute_crossword(2)
#print a.word_bank()
#print a.solution()
#print a.word_find()
#print " 1 2 3 4 5 6 7 8 9 A B C D"
print a.display()
print a.legend()
#print len(a.current_word_list), 'words used out of', len(word_list)
#print a.debug
#end_full = float(time.time())
#print end_full - start_full
if len(self.current_word_list) == 0: # this is the first word: the seed
# top left seed of longest word yields best results (maybe override)
vertical, col, row = random.randrange(0, 2), 1, 1
'''
# optional center seed method, slower and less keyword placement
if vertical:
col = int(round((self.cols + 1)/2, 0))
row = int(round((self.rows + 1)/2, 0)) - int(round((word.length + 1)/2, 0))
else:
col = int(round((self.cols + 1)/2, 0)) - int(round((word.length + 1)/2, 0))
row = int(round((self.rows + 1)/2, 0))
# completely random seed method
col = random.randrange(1, self.cols + 1)
row = random.randrange(1, self.rows + 1)
'''
if self.check_fit_score(col, row, vertical, word):
fit = True
self.set_word(col, row, vertical, word, force=True)
else: # a subsquent words have scores calculated
try:
col, row, vertical = coordlist[count][0], coordlist[count][1], coordlist[count][2]
except IndexError: return # no more cordinates, stop trying to fit
if coordlist[count][4]: # already filtered these out, but double check
fit = True
self.set_word(col, row, vertical, word, force=True)
count += 1
return
if count == 1: # check top cell only on first letter
if not self.check_if_cell_clear(col, row-1):
return 0
if count == len(word.word): # check bottom cell only on last letter
if not self.check_if_cell_clear(col, row+1):
return 0
else: # else horizontal
# check surroundings
if active_cell != letter: # don't check surroundings if cross point
if not self.check_if_cell_clear(col, row-1): # check top cell
return 0
if not self.check_if_cell_clear(col, row+1): # check bottom cell
return 0
if count == 1: # check left cell only on first letter
if not self.check_if_cell_clear(col-1, row):
return 0
if count == len(word.word): # check right cell only on last letter
if not self.check_if_cell_clear(col+1, row):
return 0
self.grid[row-1][col-1] = value
def get_cell(self, col, row):
return self.grid[row-1][col-1]
def check_if_cell_clear(self, col, row):
try:
cell = self.get_cell(col, row)
if cell == self.empty:
return True
except IndexError:
pass
return False
def solution(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
outStr += '%s ' % c
outStr += '\n'
return outStr
def word_find(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
if c == self.empty:
outStr += '%s ' % string.lowercase[random.randint(0,len(string.lowercase)-1)]
else:
outStr += '%s ' % c
outStr += '\n'
return outStr
def order_number_words(self): # orders words and applies numbering system to them
self.current_word_list.sort(key=lambda i: (i.col + i.row))
count, icount = 1, 1
for word in self.current_word_list:
word.number = count
if icount < len(self.current_word_list):
if word.col == self.current_word_list[icount].col and word.row == self.current_word_list[icount].row:
pass
else:
count += 1
icount += 1
def display(self, order=True): # return (and order/number wordlist) the grid minus the words adding the numbers
outStr = ""
if order:
self.order_number_words()
copy = self
for word in self.current_word_list:
s = str(unichr(word.number+64))
copy.set_cell(word.col, word.row, '_')
x = 1
for r in range(copy.rows):
if(x<10):
outStr += str(x) + " "
else:
outStr += str(unichr(x-10+65)) + " "
x=x+1
for c in copy.grid[r]:
outStr += '%s ' % c
outStr += '\n'
outStr = re.sub(r'[a-z]', '_', outStr)
return outStr
def word_bank(self):
outStr = ''
temp_list = duplicate(self.current_word_list)
random.shuffle(temp_list) # randomize word list
for word in temp_list:
outStr += '%s\n' % word.word
return outStr
def legend(self): # must order first
outStr = ''
for word in self.current_word_list:
r = str(word.row)
c = str(word.col)
if word.row > 9:
r = str(unichr(word.row-10+65))
if word.col > 9:
c = str(unichr(word.col-10+65))
s = str(unichr(word.number+64))
outStr += '('+r+','+c+') %s: %s' % (word.down_across(), word.clue )
return outStr
class Word(object):
def __init__(self, word=None, clue=None):
self.word = re.sub(r'\s', '', word.lower())
self.clue = clue
self.length = len(self.word)
# the below are set when placed on board
self.row = None
self.col = None
self.vertical = None
self.number = None
def down_across(self): # return down or across
if self.vertical:
return 'down'
else:
return 'across'
def __repr__(self):
return self.word
### end class, start execution
#start_full = float(time.time())
#word = open("words20.txt", "r")
word = open("C:\\JavaPersonal\\UrbanGen\\src\\words20.txt", "r")
word_list = []
for line in word:
word_list.append(line.split('|'))
a = Crossword(13, 13, '+', 5000, word_list)
a.compute_crossword(2)
#print a.word_bank()
#print a.solution()
#print a.word_find()
#print " 1 2 3 4 5 6 7 8 9 A B C D"
print a.display()
print a.legend()
#print len(a.current_word_list), 'words used out of', len(word_list)
#print a.debug
#end_full = float(time.time())
#print end_full - start_full if vertical: # progress to next letter and position
row += 1
else: # else horizontal
col += 1
count += 1
return score
def set_word(self, col, row, vertical, word, force=False): # also adds word to word list
if force:
word.col = col
word.row = row
word.vertical = vertical
self.current_word_list.append(word)
for letter in word.word:
self.set_cell(col, row, letter)
if vertical:
row += 1
else:
col += 1
return
def set_cell(self, col, row, value):
self.grid[row-1][col-1] = value
def get_cell(self, col, row):
return self.grid[row-1][col-1]
def check_if_cell_clear(self, col, row):
try:
cell = self.get_cell(col, row)
if cell == self.empty:
return True
except IndexError:
pass
return False
def solution(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
outStr += '%s ' % c
outStr += '\n'
return outStr
def word_find(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
if c == self.empty:
outStr += '%s ' % string.lowercase[random.randint(0,len(string.lowercase)-1)]
else:
outStr += '%s ' % c
outStr += '\n'
return outStr
def order_number_words(self): # orders words and applies numbering system to them
self.current_word_list.sort(key=lambda i: (i.col + i.row))
count, icount = 1, 1
for word in self.current_word_list:
word.number = count
if icount < len(self.current_word_list):
if word.col == self.current_word_list[icount].col and word.row == self.current_word_list[icount].row:
pass
else:
count += 1
icount += 1
def display(self, order=True): # return (and order/number wordlist) the grid minus the words adding the numbers
outStr = ""
if order:
self.order_number_words()
copy = self
for word in self.current_word_list:
s = str(unichr(word.number+64))
copy.set_cell(word.col, word.row, '_')
x = 1
for r in range(copy.rows):
if(x<10):
outStr += str(x) + " "
else:
outStr += str(unichr(x-10+65)) + " "
x=x+1
for c in copy.grid[r]:
outStr += '%s ' % c
outStr += '\n'
outStr = re.sub(r'[a-z]', '_', outStr)
return outStr
def word_bank(self):
outStr = ''
temp_list = duplicate(self.current_word_list)
random.shuffle(temp_list) # randomize word list
for word in temp_list:
outStr += '%s\n' % word.word
return outStr
def legend(self): # must order first
outStr = ''
for word in self.current_word_list:
r = str(word.row)
c = str(word.col)
if word.row > 9:
r = str(unichr(word.row-10+65))
if word.col > 9:
c = str(unichr(word.col-10+65))
s = str(unichr(word.number+64))
outStr += '('+r+','+c+') %s: %s' % (word.down_across(), word.clue )
return outStr
class Word(object):
def __init__(self, word=None, clue=None):
self.word = re.sub(r'\s', '', word.lower())
self.clue = clue
self.length = len(self.word)
# the below are set when placed on board
self.row = None
self.col = None
self.vertical = None
self.number = None
def down_across(self): # return down or across
if self.vertical:
return 'down'
else:
return 'across'
def __repr__(self):
return self.word
### end class, start execution
#start_full = float(time.time())
#word = open("words20.txt", "r")
word = open("C:\\JavaPersonal\\UrbanGen\\src\\words20.txt", "r") // // Change this to wherever you keep this file
word_list = []
for line in word:
word_list.append(line.split('|'))
a = Crossword(13, 13, '+', 5000, word_list)
a.compute_crossword(2)
#print a.word_bank()
#print a.solution()
#print a.word_find()
#print " 1 2 3 4 5 6 7 8 9 A B C D"
print a.display()
print a.legend()
#print len(a.current_word_list), 'words used out of', len(word_list)
#print a.debug
#end_full = float(time.time())
#print end_full - start_fulldef check_fit_score(self, col, row, vertical, word):
'''
And return score (0 signifies no fit). 1 means a fit, 2+ means a cross.
The more crosses the better.
'''
if col < 1 or row < 1:
return 0
count, score = 1, 1 # give score a standard value of 1, will override with 0 if collisions detected
for letter in word.word:
try:
active_cell = self.get_cell(col, row)
except IndexError:
return 0
if active_cell == self.empty or active_cell == letter:
pass
else:
return 0
if active_cell == letter:
score += 1
if vertical:
# check surroundings
if active_cell != letter: # don't check surroundings if cross point
if not self.check_if_cell_clear(col+1, row): # check right cell
return 0
if not self.check_if_cell_clear(col-1, row): # check left cell
return 0
if count == 1: # check top cell only on first letter
if not self.check_if_cell_clear(col, row-1):
return 0
if count == len(word.word): # check bottom cell only on last letter
if not self.check_if_cell_clear(col, row+1):
return 0
else: # else horizontal
# check surroundings
if active_cell != letter: # don't check surroundings if cross point
if not self.check_if_cell_clear(col, row-1): # check top cell
return 0
if not self.check_if_cell_clear(col, row+1): # check bottom cell
return 0
if count == 1: # check left cell only on first letter
if not self.check_if_cell_clear(col-1, row):
return 0
if count == len(word.word): # check right cell only on last letter
if not self.check_if_cell_clear(col+1, row):
return 0
self.grid[row-1][col-1] = value
def get_cell(self, col, row):
return self.grid[row-1][col-1]
def check_if_cell_clear(self, col, row):
try:
cell = self.get_cell(col, row)
if cell == self.empty:
return True
except IndexError:
pass
return False
def solution(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
outStr += '%s ' % c
outStr += '\n'
return outStr
def word_find(self): # return solution grid
outStr = ""
for r in range(self.rows):
for c in self.grid[r]:
if c == self.empty:
outStr += '%s ' % string.lowercase[random.randint(0,len(string.lowercase)-1)]
else:
outStr += '%s ' % c
outStr += '\n'
return outStr
def order_number_words(self): # orders words and applies numbering system to them
self.current_word_list.sort(key=lambda i: (i.col + i.row))
count, icount = 1, 1
for word in self.current_word_list:
word.number = count
if icount < len(self.current_word_list):
if word.col == self.current_word_list[icount].col and word.row == self.current_word_list[icount].row:
pass
else:
count += 1
icount += 1
def display(self, order=True): # return (and order/number wordlist) the grid minus the words adding the numbers
outStr = ""
if order:
self.order_number_words()
copy = self
for word in self.current_word_list:
s = str(unichr(word.number+64))
copy.set_cell(word.col, word.row, '_')
x = 1
for r in range(copy.rows):
if(x<10):
outStr += str(x) + " "
else:
outStr += str(unichr(x-10+65)) + " "
x=x+1
for c in copy.grid[r]:
outStr += '%s ' % c
outStr += '\n'
outStr = re.sub(r'[a-z]', '_', outStr)
return outStr
def word_bank(self):
outStr = ''
temp_list = duplicate(self.current_word_list)
random.shuffle(temp_list) # randomize word list
for word in temp_list:
outStr += '%s\n' % word.word
return outStr
def legend(self): # must order first
outStr = ''
for word in self.current_word_list:
r = str(word.row)
c = str(word.col)
if word.row > 9:
r = str(unichr(word.row-10+65))
if word.col > 9:
c = str(unichr(word.col-10+65))
s = str(unichr(word.number+64))
outStr += '('+r+','+c+') %s: %s' % (word.down_across(), word.clue )
return outStr
class Word(object):
def __init__(self, word=None, clue=None):
self.word = re.sub(r'\s', '', word.lower())
self.clue = clue
self.length = len(self.word)
# the below are set when placed on board
self.row = None
self.col = None
self.vertical = None
self.number = None
def down_across(self): # return down or across
if self.vertical:
return 'down'
else:
return 'across'
def __repr__(self):
return self.word
### end class, start execution
#start_full = float(time.time())
#word = open("words20.txt", "r")
word = open("C:\\JavaPersonal\\UrbanGen\\src\\words20.txt", "r") // Change this to wherever you keep this file
word_list = []
for line in word:
word_list.append(line.split('|'))
a = Crossword(13, 13, '+', 5000, word_list)
a.compute_crossword(2)
#print a.word_bank()
#print a.solution()
#print a.word_find()
#print " 1 2 3 4 5 6 7 8 9 A B C D"
print a.display()
print a.legend()
#print len(a.current_word_list), 'words used out of', len(word_list)
#print a.debug
#end_full = float(time.time())
#print end_full - start_full if vertical: # progress to next letter and position
row += 1
else: # else horizontal
col += 1
count += 1
return score
def set_word(self, col, row, vertical, word, force=False): # also adds word to word list
if force:
word.col = col
word.row = row
word.vertical = vertical
self.current_word_list.append(word)
for letter in word.word:
self.set_cell(col, row, letter)
if vertical:
row += 1
else:
col += 1
return
def set_cell(self, col, row, value):
self.grid[row-1][col-1] = value
def get_cell(self, col, row):
return self.grid[row-1][col-1]
def check_if_cell_clear(self, col, row):
try:
cell = self.get_cell(col, row)
if cell == self.empty:
return True
except IndexError: