-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathengine.c
3076 lines (2593 loc) · 129 KB
/
engine.c
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
/*****************************************************************************
* Sudoku Solver *
* *
* *
* *
* Copyright (c)2013 Toby Opferman *
*****************************************************************************/
#include <windows.h>
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include "sudoku.h"
/*
* Function Macros
*/
#define Sudoku_SetNodeComplete(b, m) (b |= m)
#define Sudoku_SetNodesDirty(b, m) (b |= m)
#define Sudoku_IsNodeDirty(b, x, y) (b & (1<<((y*3)+x)))
#define Sudoku_ClearNodeDirty(b, x, y) (b &= ~(1<<((y*3)+x)))
#define Sudoku_IsOneBitSet(x) (((x-1) & (x))==0)
/*
* Constant Definitions
*/
#define SUDOKU_COMPLETE_MASK (0x1FF)
#define MAX_THREADS 8
#define NUM_WORKER_QUEUES 9
#define FLAG_SKIP_COMPLETE_NODES 0x1
#define Sudoku_Debug
#define Sudoku_Debug_Info
#define Sudoku_Debug_States
#define Sudoku_Debug_Updates
/*
* State Machine. Lower States can Pre-Empt higher states
*/
typedef enum _SUDOKU_STATE
{
SudokuStateBug = 0,
SudokuStateFailure,
SudokuStateSolved,
SudokuStateProcessDirtyNodes,
SudokuStateVerifyConsistency,
SudokuStateFindEasyMatches,
SudokuStateFindOnlyPossibleInNodeMatches,
SudokuStateCondenseRows,
SudokuStateCondenseCols,
SudokuStateCondenseSuperRows,
SudokuStateCondenseSuperCols,
SudokuStateCondenseNodeCells,
SudokuStateSuperCondenseNodeCells,
SudokuStateSplit
} SUDOKU_STATE, *PSUDOKU_STATE;
/*
* Default "TO-FROM" State Transition Table
*/
SUDOKU_STATE g_SudokuNextStateMapping[] =
{
SudokuStateBug,
SudokuStateFailure,
SudokuStateSolved,
SudokuStateVerifyConsistency,
SudokuStateFindEasyMatches,
SudokuStateFindOnlyPossibleInNodeMatches,
SudokuStateCondenseRows,
SudokuStateCondenseCols,
SudokuStateCondenseSuperRows,
SudokuStateCondenseSuperCols,
SudokuStateCondenseNodeCells,
SudokuStateSuperCondenseNodeCells,
SudokuStateSplit,
SudokuStateSplit
};
/*
* Counter Tracking
*/
typedef enum _COUNTER_TYPE
{
CounterTypeBug,
CounterTypeFailure,
CounterTypeSplit,
CounterTypeDirections,
CounterTypeStateSwitch
} COUNTER_TYPE, *PCOUNTER_TYPE;
/*
* Internal Data Structures
*/
typedef struct _SUDOKU_COUNTERS
{
ULONG Failures;
ULONG Splits;
ULONG Directions;
ULONG Bugs;
ULONG StateSwitches;
} SUDOKU_COUNTERS, *PSUDOKU_COUNTERS;
typedef struct _SUDOKU_THREAD_COUNTERS
{
ULONG Interrupts;
ULONG WorkItemsScheduled[NUM_WORKER_QUEUES];
} SUDOKU_THREAD_COUNTERS, *PSUDOKU_THREAD_COUNTERS;
typedef struct _TIME_TRACKING
{
LARGE_INTEGER StartTime;
LARGE_INTEGER StopTime;
LARGE_INTEGER Frequency;
float Seconds;
float Microseconds;
float Milliseconds;
} TIME_TRACKING, *PTIME_TRACKING;
typedef struct _SUDOKU_CELL
{
BOOL Complete;
ULONG PossibleMask;
ULONG Number;
ULONG NodesDirtyMask;
ULONG *pCompletedRowLookup;
ULONG *pCompletedColLookup;
} SUDOKU_CELL, *PSUDOKU_CELL;
typedef struct _SUDOKU_NODE
{
BOOL Complete;
SUDOKU_CELL Cell[3][3];
ULONG CompletedMask;
ULONG NodeBitmask;
} SUDOKU_NODE, *PSUDOKU_NODE;
struct _INTERNAL_SUDOKU;
typedef struct _INTERNAL_SUDOKU INTERNAL_SUDOKU;
typedef struct _INTERNAL_SUDOKU *PINTERNAL_SUDOKU;
typedef struct _PSUDOKU_GLOBAL_SYNC
{
CRITICAL_SECTION csEngineLock;
BOOL StopAllEngines;
HANDLE hEngineComplete;
HANDLE hWorkAvailable;
HANDLE hThreadWorkerPool[MAX_THREADS];
ULONG ConcurrentThreads;
PINTERNAL_SUDOKU pSuccessConfiguration;
PINTERNAL_SUDOKU pWorkerQueue[NUM_WORKER_QUEUES];
SUDOKU_COUNTERS TotalEngineCounters;
SUDOKU_THREAD_COUNTERS ThreadCounters;
} SUDOKU_GLOBAL_SYNC, *PSUDOKU_GLOBAL_SYNC;
typedef struct _INTERNAL_SUDOKU
{
BOOL MasterEngine;
ULONG Flags;
BOOL StopEngine;
BOOL SolveAttempted;
BOOL Solved;
SUDOKU_STATE State;
SUDOKU_STATE NextState;
SUDOKU_NODE Node[3][3];
ULONG NumberOfCompletedNodes;
ULONG NumberOfCompletedRows;
ULONG NumberOfCompletedCols;
ULONG DirtyNodesBitmask;
ULONG CompleteNodesBitmask;
ULONG Priority;
ULONG CompletedRowLookup[9];
ULONG CompletedColLookup[9];
PSUDOKU_GLOBAL_SYNC pSudokuGlobalSync;
PINTERNAL_SUDOKU pWorkerQueueNext;
PINTERNAL_SUDOKU pSolutionQueueNext;
SUDOKU_COUNTERS EngineCounters;
TIME_TRACKING TimeTracking;
} INTERNAL_SUDOKU, *PINTERNAL_SUDOKU;
typedef struct _NODE_CELL_LOCATION
{
ULONG NodeX;
ULONG NodeY;
ULONG CellX;
ULONG CellY;
} NODE_CELL_LOCATION, *PNODE_CELL_LOCATION;
typedef struct _NODE_CELL_ENUMERATION_CTX
{
NODE_CELL_LOCATION NodeCellLocation;
PINTERNAL_SUDOKU pSudoku;
PSUDOKU_NODE pNode;
PSUDOKU_CELL pCell;
PVOID pContext;
} NODE_CELL_ENUMERATION_CTX, *PNODE_CELL_ENUMERATION_CTX;
typedef struct _SUDOKU_CONSISTENCY
{
ULONG NodeCompleteMatrix[3][3];
ULONG NodePossibleMatrix[3][3];
ULONG RowComplete[9];
ULONG RowPossible[9];
ULONG ColComplete[9];
ULONG ColPossible[9];
} SUDOKU_CONSISTENCY, *PSUDOKU_CONSISTENCY;
typedef struct _SUDOKU_FIND_BEST_CELL
{
ULONG NumberOfPossibilities;
ULONG NumberOfCompletedCellsInNode;
ULONG NumberOfCompletedCellsInRow;
ULONG NumberOfCompletedCellsInCol;
ULONG TotalCompleted;
ULONG MostCompleted;
PSUDOKU_CELL pBestCell;
NODE_CELL_LOCATION CellLocation;
} SUDOKU_FIND_BEST_CELL, *PSUDOKU_FIND_BEST_CELL;
typedef BOOL (*PFN_ENUMNODESANDCELLS)(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
/*******************************************************************************
* Internal Prototypes *
*******************************************************************************/
void Sudoku_ProcessDirtyNode(PINTERNAL_SUDOKU pSudoku, ULONG NodeX, ULONG NodeY);
void Sudoku_UpdateCellPossibilityMasks(PINTERNAL_SUDOKU pSudoku, PSUDOKU_NODE pSudokuNode);
PINTERNAL_SUDOKU Sudoku_StateEngine(PINTERNAL_SUDOKU pSudoku);
BOOL Sudoku_StillRunning(PINTERNAL_SUDOKU *pSudoku);
void Sudoku_ProcessEasyMatches(PINTERNAL_SUDOKU pSudoku);
void Sudoku_ProcessEasyMatchesInNode(PINTERNAL_SUDOKU pSudoku, PSUDOKU_NODE pSudokuNode);
void Sudoku_CompleteCell(PINTERNAL_SUDOKU pSudoku, PSUDOKU_NODE pSudokuNode, PSUDOKU_CELL pSudokuCell);
void Sudoku_ProcessCondenseRows(PINTERNAL_SUDOKU pSudoku);
void Sudoku_ProcessCondenseCols(PINTERNAL_SUDOKU pSudoku);
void Sudoku_ProcessSuperCondenseRows(PINTERNAL_SUDOKU pSudoku);
void Sudoku_ProcessSuperCondenseCols(PINTERNAL_SUDOKU pSudoku);
void Sudoku_ProcessSplit(PINTERNAL_SUDOKU pSudoku);
void Sudoku_ProcessBug(PINTERNAL_SUDOKU pSudoku);
void Sudoku_ProcessSolved(PINTERNAL_SUDOKU pSudoku);
void Sudoku_InitializeNodesAndCells(PINTERNAL_SUDOKU pSudoku);
ULONG Sudoku_NodeCellIndexesToRowMask(ULONG NodeIndexX, ULONG NodeIndexY);
ULONG Sudoku_NodeCellIndexesToColMask(ULONG NodeIndexX, ULONG NodeIndexY);
void Sudoku_GetNodeCellLocation(ULONG IndexX, ULONG IndexY, PNODE_CELL_LOCATION pNodeCellLocation);
ULONG Sudoku_SetBitToNumber(ULONG Mask);
void Sudoku_Debug_DisplayMatrix(PINTERNAL_SUDOKU pSudoku);
BOOL Sudoku_Debug_Print(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
void Sudoku_ProcessOnlyPossibleInNodeMatches(PINTERNAL_SUDOKU pSudoku);
void Sudoku_EnumNodesAndCellsByRows(PINTERNAL_SUDOKU pSudoku, PFN_ENUMNODESANDCELLS pEnumNodesAndCells, PVOID pContext);
void Sudoku_EnumNodesAndCellsByNodes(PINTERNAL_SUDOKU pSudoku, PFN_ENUMNODESANDCELLS pEnumNodesAndCells, PVOID pContext, ULONG Flags);
void Sudoku_EnumCellsByNode(PINTERNAL_SUDOKU pSudoku, PSUDOKU_NODE pNode, PFN_ENUMNODESANDCELLS pEnumNodesAndCells, PVOID pContext);
BOOL Sudoku_ProcessOnlyPossibleInNodeMatches_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_ProcessOnlyPossibleInNodeMatches_CompareCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_ProcessCondenseRows_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_ProcessCondenseCols_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_ProcessCondenseRows_CompareCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_ProcessCondenseCols_CompareCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_ProcessSuperCondenseRows_CompareCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_ProcessSuperCondenseCols_CompareCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
void Sudoku_ProcessVerifyConsistency(PINTERNAL_SUDOKU pSudoku);
void Sudoku_ProcessFailure(PINTERNAL_SUDOKU pSudoku);
void Sudoku_EnumNodesAndCellsByCols(PINTERNAL_SUDOKU pSudoku, PFN_ENUMNODESANDCELLS pEnumNodesAndCells, PVOID pContext);
BOOL Sudoku_Debug_PrintEx(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_FindBestSplitCell_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_Consistency_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
ULONG Sudoku_NumerOfBits(ULONG BitMask);
void Sudoku_ProcessCondenseNodeCells(PINTERNAL_SUDOKU pSudoku);
void Sudoku_ProcessSuperCondenseNodeCells(PINTERNAL_SUDOKU pSudoku);
BOOL Sudoku_ProcessCondenseNodeCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
BOOL Sudoku_ProcessSuperCondenseNodeCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration);
DWORD Sudoku_SplitEngineWorkerThread(PVOID pEngineContext);
void Sudoku_MasterThreadEngine(PINTERNAL_SUDOKU pSudoku);
PSUDOKU_GLOBAL_SYNC Sudoku_CreateGlobalSyncContext(void);
PSUDOKU_CELL Sudoku_FindBestSplitCell(PINTERNAL_SUDOKU pSudoku, PNODE_CELL_LOCATION pCellLocation);
void Sudoku_AddWorkToQueue(PINTERNAL_SUDOKU pSudoku, PSUDOKU_CELL pBestCell, PNODE_CELL_LOCATION pCellLocation);
PINTERNAL_SUDOKU Sudoku_CreateDuplicateContext(PINTERNAL_SUDOKU pSudoku);
void Sudoku_NextState(PINTERNAL_SUDOKU pSudoku);
void Sudoku_SetNextState(PINTERNAL_SUDOKU pSudoku, SUDOKU_STATE SudokuState);
void Sudoku_MaskCellPossibilities(PINTERNAL_SUDOKU pSudoku, PSUDOKU_CELL pSudokuCell, ULONG Mask);
void Sudoku_StopEngine(PINTERNAL_SUDOKU pSudoku);
void Sudoku_StopAllEngines(PINTERNAL_SUDOKU pSudoku);
void Sudoku_UpdateCounter(PINTERNAL_SUDOKU pSudoku, COUNTER_TYPE CounterType, ULONG Count);
void Sudoku_PreserveTotalEngineCounters(PINTERNAL_SUDOKU pSudoku);
void Sudoku_Free(HSUDOKU hSudoku);
void Sudoku_DisplayCounters(PINTERNAL_SUDOKU pSudoku);
void Sudoku_StartTimer(PTIME_TRACKING pTimeTracking);
void Sudoku_StopTimer(PTIME_TRACKING pTimeTracking);
void Sudoku_DisplayTime(PTIME_TRACKING pTimeTracking);
BOOL Sudoku_WorkerQueuesAreEmpty(PSUDOKU_GLOBAL_SYNC pSudokuEngine, ULONG LowestPriority);
PINTERNAL_SUDOKU Sudoku_GetNextWorkItem(PSUDOKU_GLOBAL_SYNC pSudokuEngine, ULONG LowestPriority);
void Sudoku_PushWorkItem(PSUDOKU_GLOBAL_SYNC pSudokuEngine, PINTERNAL_SUDOKU pSudoku);
void Sudoku_UpdateContextPriority(PINTERNAL_SUDOKU pSudoku);
/******************************************************************************
* Sudoku_Init
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
HSUDOKU Sudoku_Init(ULONG *pSudokuTable, ULONG Flags)
{
PINTERNAL_SUDOKU pInternalSudoku;
ULONG IndexX;
ULONG IndexY;
NODE_CELL_LOCATION NodeCellLocation;
pInternalSudoku = (PINTERNAL_SUDOKU)LocalAlloc(LMEM_ZEROINIT, sizeof(INTERNAL_SUDOKU));
if(pInternalSudoku)
{
Sudoku_InitializeNodesAndCells(pInternalSudoku);
pInternalSudoku->Flags = Flags;
pInternalSudoku->MasterEngine = TRUE;
for(IndexY = 0; IndexY < 9; IndexY++)
{
for(IndexX = 0; IndexX < 9; IndexX++)
{
if(pSudokuTable[IndexY*9 + IndexX] != 0)
{
Sudoku_GetNodeCellLocation(IndexX,IndexY,&NodeCellLocation);
pInternalSudoku->Node[NodeCellLocation.NodeY][NodeCellLocation.NodeX].Cell[NodeCellLocation.CellY][NodeCellLocation.CellX].PossibleMask = (1<<(pSudokuTable[IndexY*9 + IndexX]-1));
Sudoku_CompleteCell(pInternalSudoku, &pInternalSudoku->Node[NodeCellLocation.NodeY][NodeCellLocation.NodeX], &pInternalSudoku->Node[NodeCellLocation.NodeY][NodeCellLocation.NodeX].Cell[NodeCellLocation.CellY][NodeCellLocation.CellX]);
}
}
}
pInternalSudoku->State = SudokuStateProcessDirtyNodes;
pInternalSudoku->NextState = SudokuStateVerifyConsistency;
}
return (HSUDOKU)pInternalSudoku;
}
/*******************************************************************************
* Sudoku_Solve
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
BOOL Sudoku_Solve(HSUDOKU hSudoku)
{
PINTERNAL_SUDOKU pInternalSudoku = (PINTERNAL_SUDOKU)hSudoku;
if(pInternalSudoku->SolveAttempted == FALSE)
{
pInternalSudoku->SolveAttempted = TRUE;
Sudoku_StartTimer(&pInternalSudoku->TimeTracking);
Sudoku_StateEngine(pInternalSudoku);
Sudoku_StopTimer(&pInternalSudoku->TimeTracking);
}
return pInternalSudoku->Solved;
}
/*******************************************************************************
* Sudoku_Free
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
void Sudoku_Free(HSUDOKU hSudoku)
{
PINTERNAL_SUDOKU pInternalSudoku = (PINTERNAL_SUDOKU)hSudoku;
PINTERNAL_SUDOKU pSudokuUncompletedWorkItem;
UINT Index;
if(pInternalSudoku->pSudokuGlobalSync)
{
if(pInternalSudoku->pSudokuGlobalSync->pSuccessConfiguration)
{
LocalFree(pInternalSudoku->pSudokuGlobalSync->pSuccessConfiguration);
}
for(Index = 0; Index < NUM_WORKER_QUEUES; Index++)
{
while(pInternalSudoku->pSudokuGlobalSync->pWorkerQueue[Index])
{
pSudokuUncompletedWorkItem = pInternalSudoku->pSudokuGlobalSync->pWorkerQueue[Index];
pInternalSudoku->pSudokuGlobalSync->pWorkerQueue[Index] = pInternalSudoku->pSudokuGlobalSync->pWorkerQueue[Index]->pWorkerQueueNext;
LocalFree(pSudokuUncompletedWorkItem);
}
}
LocalFree(pInternalSudoku->pSudokuGlobalSync);
}
LocalFree(pInternalSudoku);
}
/*******************************************************************************
* Sudoku_ProcessDirtyNodes
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
void Sudoku_ProcessDirtyNodes(PINTERNAL_SUDOKU pSudoku)
{
ULONG IndexX;
ULONG IndexY;
for(IndexY = 0; IndexY < 3 && pSudoku->DirtyNodesBitmask; IndexY++)
{
for(IndexX = 0; IndexX < 3 && pSudoku->DirtyNodesBitmask; IndexX++)
{
if(Sudoku_IsNodeDirty(pSudoku->DirtyNodesBitmask, IndexX, IndexY))
{
if(pSudoku->Node[IndexY][IndexX].Complete == FALSE)
{
Sudoku_UpdateCellPossibilityMasks(pSudoku, &pSudoku->Node[IndexY][IndexX]);
}
Sudoku_ClearNodeDirty(pSudoku->DirtyNodesBitmask, IndexX, IndexY);
}
}
}
}
/*******************************************************************************
* Sudoku_ProcessEasyMatches
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
void Sudoku_ProcessEasyMatches(PINTERNAL_SUDOKU pSudoku)
{
ULONG IndexX;
ULONG IndexY;
for(IndexY = 0; IndexY < 3; IndexY++)
{
for(IndexX = 0; IndexX < 3; IndexX++)
{
if(pSudoku->Node[IndexY][IndexX].Complete == FALSE)
{
Sudoku_ProcessEasyMatchesInNode(pSudoku, &pSudoku->Node[IndexY][IndexX]);
}
}
}
}
/*******************************************************************************
* Sudoku_ProcessCondenseCols_CompareCells_Callback
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
BOOL Sudoku_ProcessCondenseCols_CompareCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration)
{
PNODE_CELL_ENUMERATION_CTX pOriginalNodeEnum = (PNODE_CELL_ENUMERATION_CTX)pNodeCellEnumeration->pContext;
ULONG PossibleMask;
PossibleMask = *((ULONG *)pOriginalNodeEnum->pContext);
if(pNodeCellEnumeration->pCell->Complete == FALSE)
{
if(pNodeCellEnumeration->NodeCellLocation.CellX != pOriginalNodeEnum->NodeCellLocation.CellX)
{
if((pNodeCellEnumeration->pCell->PossibleMask & PossibleMask) == PossibleMask)
{
Sudoku_Debug(" Removing Mask(0x%0x) from Mask (0x%0x) Node (%i, %i) Cell (%i, %i)", PossibleMask, pNodeCellEnumeration->pCell->PossibleMask, pNodeCellEnumeration->NodeCellLocation.NodeX, pNodeCellEnumeration->NodeCellLocation.NodeY, pNodeCellEnumeration->NodeCellLocation.CellX, pNodeCellEnumeration->NodeCellLocation.CellY);
Sudoku_MaskCellPossibilities(pNodeCellEnumeration->pSudoku, pNodeCellEnumeration->pCell, (~PossibleMask));
}
}
}
return TRUE;
}
/*******************************************************************************
* Sudoku_ProcessCondenseRows_CompareCells_Callback
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
BOOL Sudoku_ProcessCondenseRows_CompareCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration)
{
PNODE_CELL_ENUMERATION_CTX pOriginalNodeEnum = (PNODE_CELL_ENUMERATION_CTX)pNodeCellEnumeration->pContext;
ULONG PossibleMask;
PossibleMask = *((ULONG *)pOriginalNodeEnum->pContext);
if(pNodeCellEnumeration->pCell->Complete == FALSE)
{
if(pNodeCellEnumeration->NodeCellLocation.CellY != pOriginalNodeEnum->NodeCellLocation.CellY)
{
if((pNodeCellEnumeration->pCell->PossibleMask & PossibleMask) == PossibleMask)
{
Sudoku_Debug(" Removing Mask(0x%0x) from Mask (0x%0x) Node (%i, %i) Cell (%i, %i)", PossibleMask, pNodeCellEnumeration->pCell->PossibleMask, pNodeCellEnumeration->NodeCellLocation.NodeX, pNodeCellEnumeration->NodeCellLocation.NodeY, pNodeCellEnumeration->NodeCellLocation.CellX, pNodeCellEnumeration->NodeCellLocation.CellY);
Sudoku_MaskCellPossibilities(pNodeCellEnumeration->pSudoku, pNodeCellEnumeration->pCell, (~PossibleMask));
}
}
}
return TRUE;
}
/*******************************************************************************
* Sudoku_ProcessOnlyPossibleInNodeMatches_CompareCells_Callback
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
BOOL Sudoku_ProcessOnlyPossibleInNodeMatches_CompareCells_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration)
{
PNODE_CELL_ENUMERATION_CTX pOriginalNodeEnum = (PNODE_CELL_ENUMERATION_CTX)pNodeCellEnumeration->pContext;
ULONG *PossibleMask = (ULONG *)pOriginalNodeEnum->pContext;
BOOL ContinueProcessing;
ContinueProcessing = TRUE;
if(pNodeCellEnumeration->pCell->Complete == FALSE)
{
if(pNodeCellEnumeration->pCell != pOriginalNodeEnum->pCell)
{
Sudoku_Debug(" Node(%i, %i) Cell(%i, %i) Mask(0x%0x)\n", pNodeCellEnumeration->NodeCellLocation.NodeX, pNodeCellEnumeration->NodeCellLocation.NodeY, pNodeCellEnumeration->NodeCellLocation.CellX, pNodeCellEnumeration->NodeCellLocation.CellY, pNodeCellEnumeration->pCell->PossibleMask);
*PossibleMask = (*PossibleMask ^ pNodeCellEnumeration->pCell->PossibleMask) & *PossibleMask;
if(*PossibleMask == 0)
{
ContinueProcessing = FALSE;
}
}
}
return ContinueProcessing;
}
/*******************************************************************************
* Sudoku_ProcessOnlyPossibleInNodeMatches_Callback
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
BOOL Sudoku_ProcessOnlyPossibleInNodeMatches_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration)
{
ULONG PossibleMask;
if(pNodeCellEnumeration->pCell->Complete == FALSE)
{
PossibleMask = pNodeCellEnumeration->pCell->PossibleMask;
Sudoku_Debug("Node(%i, %i) Cell(%i, %i) Mask(0x%0x)\n", pNodeCellEnumeration->NodeCellLocation.NodeX, pNodeCellEnumeration->NodeCellLocation.NodeY, pNodeCellEnumeration->NodeCellLocation.CellX, pNodeCellEnumeration->NodeCellLocation.CellY, pNodeCellEnumeration->pCell->PossibleMask);
pNodeCellEnumeration->pContext = &PossibleMask;
Sudoku_EnumCellsByNode(pNodeCellEnumeration->pSudoku, pNodeCellEnumeration->pNode, Sudoku_ProcessOnlyPossibleInNodeMatches_CompareCells_Callback, pNodeCellEnumeration);
if(PossibleMask)
{
Sudoku_Debug("New Possible Mask 0x%0x\n\n", PossibleMask);
pNodeCellEnumeration->pCell->PossibleMask = PossibleMask;
Sudoku_CompleteCell(pNodeCellEnumeration->pSudoku, pNodeCellEnumeration->pNode, pNodeCellEnumeration->pCell);
}
}
return TRUE;
}
/*******************************************************************************
* Sudoku_ProcessCondenseRows_Callback
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
BOOL Sudoku_ProcessCondenseRows_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration)
{
ULONG PossibleMask;
ULONG RowIndex;
ULONG NodeIndex;
if(pNodeCellEnumeration->pCell->Complete == FALSE)
{
PossibleMask = pNodeCellEnumeration->pCell->PossibleMask;
Sudoku_Debug("Node(%i, %i) Cell(%i, %i) Mask(0x%0x)\n", pNodeCellEnumeration->NodeCellLocation.NodeX, pNodeCellEnumeration->NodeCellLocation.NodeY, pNodeCellEnumeration->NodeCellLocation.CellX, pNodeCellEnumeration->NodeCellLocation.CellY, pNodeCellEnumeration->pCell->PossibleMask);
for(NodeIndex = 0; NodeIndex < 3 && PossibleMask; NodeIndex++)
{
if(pNodeCellEnumeration->NodeCellLocation.NodeX != NodeIndex)
{
if(pNodeCellEnumeration->pSudoku->Node[pNodeCellEnumeration->NodeCellLocation.NodeY][NodeIndex].Complete == FALSE)
{
for(RowIndex = 0; RowIndex < 3 && PossibleMask; RowIndex++)
{
if(pNodeCellEnumeration->pSudoku->Node[pNodeCellEnumeration->NodeCellLocation.NodeY][NodeIndex].Cell[pNodeCellEnumeration->NodeCellLocation.CellY][RowIndex].Complete == FALSE)
{
Sudoku_Debug(" Node(%i, %i) Cell(%i, %i) Mask(0x%0x)\n", NodeIndex, pNodeCellEnumeration->NodeCellLocation.NodeY, RowIndex, pNodeCellEnumeration->NodeCellLocation.CellY, pNodeCellEnumeration->pSudoku->Node[pNodeCellEnumeration->NodeCellLocation.NodeY][NodeIndex].Cell[pNodeCellEnumeration->NodeCellLocation.CellY][RowIndex].PossibleMask);
PossibleMask = (PossibleMask ^ pNodeCellEnumeration->pSudoku->Node[pNodeCellEnumeration->NodeCellLocation.NodeY][NodeIndex].Cell[pNodeCellEnumeration->NodeCellLocation.CellY][RowIndex].PossibleMask) & PossibleMask;
}
}
}
}
}
if(PossibleMask)
{
Sudoku_Debug("New Possible Mask 0x%0x\n\n", PossibleMask);
pNodeCellEnumeration->pContext = &PossibleMask;
Sudoku_EnumCellsByNode(pNodeCellEnumeration->pSudoku, pNodeCellEnumeration->pNode, Sudoku_ProcessCondenseRows_CompareCells_Callback, pNodeCellEnumeration);
}
}
return TRUE;
}
/*******************************************************************************
* Sudoku_ProcessCondenseCols_Callback
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
BOOL Sudoku_ProcessCondenseCols_Callback(PNODE_CELL_ENUMERATION_CTX pNodeCellEnumeration)
{
ULONG PossibleMask;
ULONG ColIndex;
ULONG NodeIndex;
if(pNodeCellEnumeration->pCell->Complete == FALSE)
{
PossibleMask = pNodeCellEnumeration->pCell->PossibleMask;
Sudoku_Debug("Node(%i, %i) Cell(%i, %i) Mask(0x%0x)\n", pNodeCellEnumeration->NodeCellLocation.NodeX, pNodeCellEnumeration->NodeCellLocation.NodeY, pNodeCellEnumeration->NodeCellLocation.CellX, pNodeCellEnumeration->NodeCellLocation.CellY, pNodeCellEnumeration->pCell->PossibleMask);
for(NodeIndex = 0; NodeIndex < 3 && PossibleMask; NodeIndex++)
{
if(pNodeCellEnumeration->NodeCellLocation.NodeY != NodeIndex)
{
if(pNodeCellEnumeration->pSudoku->Node[NodeIndex][pNodeCellEnumeration->NodeCellLocation.NodeX].Complete == FALSE)
{
for(ColIndex = 0; ColIndex < 3 && PossibleMask; ColIndex++)
{
if(pNodeCellEnumeration->pSudoku->Node[NodeIndex][pNodeCellEnumeration->NodeCellLocation.NodeX].Cell[ColIndex][pNodeCellEnumeration->NodeCellLocation.CellX].Complete == FALSE)
{
Sudoku_Debug(" Node(%i, %i) Cell(%i, %i) Mask(0x%0x)\n", pNodeCellEnumeration->NodeCellLocation.NodeX, NodeIndex, pNodeCellEnumeration->NodeCellLocation.CellX, ColIndex, pNodeCellEnumeration->pSudoku->Node[NodeIndex][pNodeCellEnumeration->NodeCellLocation.NodeX].Cell[ColIndex][pNodeCellEnumeration->NodeCellLocation.CellX].PossibleMask);
PossibleMask = (PossibleMask ^ pNodeCellEnumeration->pSudoku->Node[NodeIndex][pNodeCellEnumeration->NodeCellLocation.NodeX].Cell[ColIndex][pNodeCellEnumeration->NodeCellLocation.CellX].PossibleMask) & PossibleMask;
}
}
}
}
}
if(PossibleMask)
{
Sudoku_Debug("New Possible Mask 0x%0x\n\n", PossibleMask);
pNodeCellEnumeration->pContext = &PossibleMask;
Sudoku_EnumCellsByNode(pNodeCellEnumeration->pSudoku, pNodeCellEnumeration->pNode, Sudoku_ProcessCondenseCols_CompareCells_Callback, pNodeCellEnumeration);
}
}
return TRUE;
}
/*******************************************************************************
* Sudoku_ProcessOnlyPossibleInNodeMatches
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
void Sudoku_ProcessOnlyPossibleInNodeMatches(PINTERNAL_SUDOKU pSudoku)
{
Sudoku_EnumNodesAndCellsByNodes(pSudoku, Sudoku_ProcessOnlyPossibleInNodeMatches_Callback, NULL, FLAG_SKIP_COMPLETE_NODES);
}
/*******************************************************************************
* Sudoku_UpdateCellPossibilityMasks
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
void Sudoku_UpdateCellPossibilityMasks(PINTERNAL_SUDOKU pSudoku, PSUDOKU_NODE pSudokuNode)
{
ULONG IndexX;
ULONG IndexY;
for(IndexX = 0; IndexX < 3; IndexX++)
{
for(IndexY = 0; IndexY < 3; IndexY++)
{
if(pSudokuNode->Cell[IndexY][IndexX].Complete == FALSE)
{
Sudoku_MaskCellPossibilities(pSudoku, &pSudokuNode->Cell[IndexY][IndexX], (~pSudokuNode->CompletedMask));
Sudoku_MaskCellPossibilities(pSudoku, &pSudokuNode->Cell[IndexY][IndexX], (~(*pSudokuNode->Cell[IndexY][IndexX].pCompletedRowLookup)));
Sudoku_MaskCellPossibilities(pSudoku, &pSudokuNode->Cell[IndexY][IndexX], (~(*pSudokuNode->Cell[IndexY][IndexX].pCompletedColLookup)));
}
}
}
}
/*******************************************************************************
* Sudoku_StillRunning
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
BOOL Sudoku_StillRunning(PINTERNAL_SUDOKU *pSudoku)
{
BOOL EngineRunning = TRUE;
PINTERNAL_SUDOKU pSudokuNew;
PINTERNAL_SUDOKU pSudokuCurrent;
pSudokuCurrent = *pSudoku;
if(pSudokuCurrent->MasterEngine == FALSE)
{
if(pSudokuCurrent->pSudokuGlobalSync->StopAllEngines)
{
EngineRunning = FALSE;
}
if((pSudokuCurrent->Flags & FS_PRIORITY_INTERRUPTS) != 0)
{
EnterCriticalSection(&pSudokuCurrent->pSudokuGlobalSync->csEngineLock);
if(pSudokuCurrent->pSudokuGlobalSync->ConcurrentThreads == MAX_THREADS)
{
if(Sudoku_WorkerQueuesAreEmpty(pSudokuCurrent->pSudokuGlobalSync, pSudokuCurrent->Priority+1) == FALSE)
{
pSudokuNew = Sudoku_GetNextWorkItem(pSudokuCurrent->pSudokuGlobalSync, pSudokuCurrent->Priority+1);
Sudoku_PushWorkItem(pSudokuCurrent->pSudokuGlobalSync, *pSudoku);
*pSudoku = pSudokuNew;
pSudokuCurrent = pSudokuNew;
pSudokuCurrent->pSudokuGlobalSync->ThreadCounters.Interrupts++;
}
}
LeaveCriticalSection(&pSudokuCurrent->pSudokuGlobalSync->csEngineLock);
}
}
if(pSudokuCurrent->StopEngine)
{
EngineRunning = FALSE;
}
return EngineRunning;
}
/*******************************************************************************
* Sudoku_CompleteCell
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
void Sudoku_CompleteCell(PINTERNAL_SUDOKU pSudoku, PSUDOKU_NODE pSudokuNode, PSUDOKU_CELL pSudokuCell)
{
if(pSudokuCell->PossibleMask != 0)
{
pSudokuCell->Complete = TRUE;
*pSudokuCell->pCompletedColLookup |= pSudokuCell->PossibleMask;
*pSudokuCell->pCompletedRowLookup |= pSudokuCell->PossibleMask;
if((*pSudokuCell->pCompletedColLookup & SUDOKU_COMPLETE_MASK) == SUDOKU_COMPLETE_MASK)
{
pSudoku->NumberOfCompletedCols++;
}
if((*pSudokuCell->pCompletedRowLookup & SUDOKU_COMPLETE_MASK) == SUDOKU_COMPLETE_MASK)
{
pSudoku->NumberOfCompletedRows++;
}
pSudokuCell->Number = Sudoku_SetBitToNumber(pSudokuCell->PossibleMask);
Sudoku_SetNextState(pSudoku, SudokuStateProcessDirtyNodes);
pSudokuNode->CompletedMask |= pSudokuCell->PossibleMask;
if((pSudokuNode->CompletedMask & SUDOKU_COMPLETE_MASK) == SUDOKU_COMPLETE_MASK)
{
Sudoku_Debug(" Setting Node Complete\n");
pSudokuNode->Complete = TRUE;
pSudoku->CompleteNodesBitmask |= pSudokuNode->NodeBitmask;
pSudoku->NumberOfCompletedNodes++;
if((pSudoku->CompleteNodesBitmask & SUDOKU_COMPLETE_MASK) == SUDOKU_COMPLETE_MASK)
{
Sudoku_SetNextState(pSudoku, SudokuStateSolved);
}
}
Sudoku_UpdateContextPriority(pSudoku);
Sudoku_SetNodesDirty(pSudoku->DirtyNodesBitmask, pSudokuCell->NodesDirtyMask);
}
else
{
Sudoku_SetNextState(pSudoku, SudokuStateBug);
}
}
/*******************************************************************************
* Sudoku_ProcessEasyMatchesInNode
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
void Sudoku_ProcessEasyMatchesInNode(PINTERNAL_SUDOKU pSudoku, PSUDOKU_NODE pSudokuNode)
{
ULONG IndexX;
ULONG IndexY;
for(IndexX = 0; IndexX < 3; IndexX++)
{
for(IndexY = 0; IndexY < 3; IndexY++)
{
if(pSudokuNode->Cell[IndexY][IndexX].Complete == FALSE)
{
if(Sudoku_IsOneBitSet(pSudokuNode->Cell[IndexY][IndexX].PossibleMask))
{
Sudoku_CompleteCell(pSudoku, pSudokuNode, &pSudokuNode->Cell[IndexY][IndexX]);
}
}
}
}
}
/*******************************************************************************
* Sudoku_StateEngine
*
* DESCRIPTION:
*
* INPUT
*
*
* OUTPUT
*
*
*******************************************************************************/
PINTERNAL_SUDOKU Sudoku_StateEngine(PINTERNAL_SUDOKU pSudoku)
{
while(Sudoku_StillRunning(&pSudoku))
{
switch(pSudoku->State)
{
case SudokuStateProcessDirtyNodes: