-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgame.asm
731 lines (569 loc) · 33.2 KB
/
game.asm
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
@CODE
do_next_move: PUSH R0
PUSH R1
LOAD R0 2 ; Load R0 to check for win
BRS check_can_win_block
CMP R0 -1
BEQ do_next_move_r
LOAD R0 0 ; Load R0 to check for block
BRS check_can_win_block
CMP R0 -1
BEQ do_next_move_r
LOAD R0 2 ; Load R0 to check for own fork
BRS check_forks
CMP R0 -1
BEQ do_next_move_r
LOAD R0 0 ; Load R0 to check for opponent fork
BRS check_forks
CMP R0 -1
BEQ do_next_move_r
BRS check_center ; Check whether center is empty
CMP R0 -1
BEQ do_next_move_r
BRS check_opposite_corners ; Check opposite corners
CMP R0 -1
BEQ do_next_move_r
BRS check_empty_corner ; Check whether there is an empty corner
CMP R0 -1
BEQ do_next_move_r
BRS check_empty_side ; Check whether there's an empty middle in edge
CMP R0 -1
BEQ do_next_move_r
BRA tie
do_next_move_r: LOAD R0 2
BRS check_win
BRS check_tie
LOAD R0 3
LOAD R1 2
BRS move_to_pos
LOAD R0 0
STOR R0 [GB+IS_FIRST_MOVE]
PULL R1
PULL R0
RTS
;---------------------------------------------------------------------------------;
; INPUT: R0 = color. So 2 to check for win, 0 to check for block
check_can_win_block: PUSH R1
; Check rows
LOAD R1 R0
LOAD R0 0
BRS check_row
CMP R0 -1
BEQ check_can_win_r
LOAD R0 1
BRS check_row
CMP R0 -1
BEQ check_can_win_r
LOAD R0 2
BRS check_row
CMP R0 -1
BEQ check_can_win_r
; Check cols
LOAD R0 0
BRS check_col
CMP R0 -1
BEQ check_can_win_r
LOAD R0 1
BRS check_col
CMP R0 -1
BEQ check_can_win_r
LOAD R0 2
BRS check_col
CMP R0 -1
BEQ check_can_win_r
; Check diagnals
BRS check_diag1
CMP R0 -1
BEQ check_can_win_r
BRS check_diag2
CMP R0 -1
BEQ check_can_win_r
check_can_win_r: PULL R1
RTS
;---------------------------------------------------------------------------------;
; INPUT: R0 = y
; R1 = color
; OUTPUT: R0 = -1 if and only if it has found (and done) a move.
check_row: PUSH R1
PUSH R2
PUSH R3
LOAD R3 GB
ADD R3 GRID
PUSH R3
LOAD R2 R0
MULS R2 3
ADD R2 0
LOAD R0 [[SP]+R2]
LOAD R3 0 ; R3 = color counter
LOAD R4 0 ; R4 = empty counter
CMP R0 R1
BNE check_row_check_empty1
ADD R3 1
BRA check_row_color2
check_row_check_empty1: CMP R0 1
BNE check_row_color2
ADD R4 1
check_row_color2: ADD R2 1
LOAD R0 [[SP]+R2]
CMP R0 R1
BNE check_row_check_empty2
ADD R3 1
BRA check_row_color3
check_row_check_empty2: CMP R0 1
BNE check_row_color3
ADD R4 1
check_row_color3: ADD R2 1
LOAD R0 [[SP]+R2]
CMP R0 R1
BNE check_row_check_empty3
ADD R3 1
BRA check_row_count_colors
check_row_check_empty3: CMP R0 1
BNE check_row_count_colors
ADD R4 1
check_row_count_colors:
CMP R3 2
BNE check_row_r
CMP R4 1
BNE check_row_r
CMP R0 1
BEQ check_row_return_empty
SUB R2 1
LOAD R0 [[SP]+R2]
CMP R0 1
BEQ check_row_return_empty
SUB R2 1
LOAD R0 [[SP]+R2]
CMP R0 1
BNE check_row_r
check_row_return_empty: LOAD R0 R2
BRS do_move
LOAD R0 -1
check_row_r: ADD SP 1
PULL R3
PULL R2
PULL R1
RTS
;---------------------------------------------------------------------------------;
; INPUT: R0 = x
; R1 = color
; OUTPUT: R0 = -1 if and only if it has found (and done) a move.
check_col: PUSH R1
PUSH R2
PUSH R3
LOAD R3 GB
ADD R3 GRID
PUSH R3
LOAD R2 R0
LOAD R0 [[SP]+R2]
LOAD R3 0 ; R3 = color counter
LOAD R4 0 ; R4 = empty counter
CMP R0 R1
BNE check_col_check_empty1
ADD R3 1
BRA check_col_color2
check_col_check_empty1: CMP R0 1
BNE check_col_color2
ADD R4 1
check_col_color2: ADD R2 3
LOAD R0 [[SP]+R2]
CMP R0 R1
BNE check_col_check_empty2
ADD R3 1
BRA check_col_color3
check_col_check_empty2: CMP R0 1
BNE check_col_color3
ADD R4 1
check_col_color3: ADD R2 3
LOAD R0 [[SP]+R2]
CMP R0 R1
BNE check_col_check_empty3
ADD R3 1
BRA check_col_count_colors
check_col_check_empty3: CMP R0 1
BNE check_col_count_colors
ADD R4 1
check_col_count_colors:
CMP R3 2
BNE check_col_r
CMP R4 1
BNE check_col_r
CMP R0 1
BEQ check_col_return_empty
SUB R2 3
LOAD R0 [[SP]+R2]
CMP R0 1
BEQ check_col_return_empty
SUB R2 3
LOAD R0 [[SP]+R2]
CMP R0 1
BNE check_col_r
check_col_return_empty: LOAD R0 R2
BRS do_move
LOAD R0 -1
check_col_r: ADD SP 1
PULL R3
PULL R2
PULL R1
RTS
;---------------------------------------------------------------------------------;
; INPUT: R1 = color
; OUTPUT: R0 = -1 if and only if it has found (and done) a move.
check_diag1: PUSH R1
PUSH R2
PUSH R3
LOAD R3 GB
ADD R3 GRID
PUSH R3
LOAD R2 0
LOAD R0 [[SP]+R2]
LOAD R3 0 ; R3 = color counter
LOAD R4 0 ; R4 = empty counter
CMP R0 R1
BNE check_diag1_check_empty1
ADD R3 1
BRA check_diag1_color2
check_diag1_check_empty1: CMP R0 1
BNE check_diag1_color2
ADD R4 1
check_diag1_color2: ADD R2 4
LOAD R0 [[SP]+R2]
CMP R0 R1
BNE check_diag1_check_empty2
ADD R3 1
BRA check_diag1_color3
check_diag1_check_empty2: CMP R0 1
BNE check_diag1_color3
ADD R4 1
check_diag1_color3: ADD R2 4
LOAD R0 [[SP]+R2]
CMP R0 R1
BNE check_diag1_check_empty3
ADD R3 1
BRA check_diag1_count_colors
check_diag1_check_empty3: CMP R0 1
BNE check_diag1_count_colors
ADD R4 1
check_diag1_count_colors:
CMP R3 2
BNE check_diag1_r
CMP R4 1
BNE check_diag1_r
CMP R0 1
BEQ check_diag1_return_empty
SUB R2 4
LOAD R0 [[SP]+R2]
CMP R0 1
BEQ check_diag1_return_empty
SUB R2 4
LOAD R0 [[SP]+R2]
CMP R0 1
BNE check_diag1_r
check_diag1_return_empty: LOAD R0 R2
BRS do_move
LOAD R0 -1
check_diag1_r: ADD SP 1
PULL R3
PULL R2
PULL R1
RTS
;---------------------------------------------------------------------------------;
; INPUT: R1 = color
; OUTPUT: R0 = -1 if and only if it has found (and done) a move.
check_diag2: PUSH R1
PUSH R2
PUSH R3
LOAD R3 GB
ADD R3 GRID
PUSH R3
LOAD R2 2
LOAD R0 [[SP]+R2]
LOAD R3 0 ; R3 = color counter
LOAD R4 0 ; R4 = empty counter
CMP R0 R1
BNE check_diag2_check_empty1
ADD R3 1
BRA check_diag2_color2
check_diag2_check_empty1: CMP R0 1
BNE check_diag2_color2
ADD R4 1
check_diag2_color2: ADD R2 2
LOAD R0 [[SP]+R2]
CMP R0 R1
BNE check_diag2_check_empty2
ADD R3 1
BRA check_diag2_color3
check_diag2_check_empty2: CMP R0 1
BNE check_diag2_color3
ADD R4 1
check_diag2_color3: ADD R2 2
LOAD R0 [[SP]+R2]
CMP R0 R1
BNE check_diag2_check_empty3
ADD R3 1
BRA check_diag2_count_colors
check_diag2_check_empty3: CMP R0 1
BNE check_diag2_count_colors
ADD R4 1
check_diag2_count_colors:
CMP R3 2
BNE check_diag2_r
CMP R4 1
BNE check_diag2_r
CMP R0 1
BEQ check_diag2_return_empty
SUB R2 2
LOAD R0 [[SP]+R2]
CMP R0 1
BEQ check_diag2_return_empty
SUB R2 2
LOAD R0 [[SP]+R2]
CMP R0 1
BNE check_diag2_r
check_diag2_return_empty: LOAD R0 R2
BRS do_move
LOAD R0 -1
check_diag2_r: ADD SP 1
PULL R3
PULL R2
PULL R1
RTS
;---------------------------------------------------------------------------------;
; INPUT: R0 = color
; OUTPUT: R0 = -1 if and only if it has found (and done) a move.
check_forks:
PUSH R1 ; R1 will keep a copy of the current fork being checked
PUSH R2 ; R2 will store the pointer to the current fork in RAM
PUSH R3
PUSH R4
LOAD R3 R0
LOAD R2 GB
ADD R2 FORK_DIAG0
BRS encode_grid ; Returns in R0
LOAD R4 R0
check_forks_while: LOAD R1 [R2] ; Load fork from RAM in R1
CMP R1 -1 ; Forks are -1 terminated
BEQ check_forks_r
LOAD R0 R4
AND R0 R1 ; Compare fork with current state
CMP R0 R1
BEQ check_forks_found
ADD R2 3
BRA check_forks_while
check_forks_found: DIV R3 2
ADD R3 1
MOD R3 2
ADD R3 1
LOAD R0 [R2+R3]
BRS do_move
LOAD R0 -1
check_forks_r: PULL R4
PULL R3
PULL R2
PULL R1
RTS
;---------------------------------------------------------------------------------;
; OUTPUT: R0 = -1 if and only if it has found (and done) a move.
check_center: LOAD R0 GB
ADD R0 GRID
LOAD R0 [R0+4] ; Load center value in R0
CMP R0 1
BNE check_center_r
LOAD R0 4
BRS do_move
LOAD R0 -1
check_center_r: RTS
;---------------------------------------------------------------------------------;
; OUTPUT: R0 = -1 if and only if it has found (and done) a move.
check_opposite_corners: PUSH R1
PUSH R2
LOAD R0 GB
ADD R0 GRID
LOAD R2 0
LOAD R1 [R0+R2]
CMP R1 0
BNE check_opposite_corner_1
LOAD R2 8
LOAD R1 [R0+R2]
CMP R1 1
BEQ check_opposite_corner_found
check_opposite_corner_1: LOAD R2 2
LOAD R1 [R0+R2]
CMP R1 0
BNE check_opposite_corner_2
LOAD R2 6
LOAD R1 [R0+R2]
CMP R1 1
BEQ check_opposite_corner_found
check_opposite_corner_2: LOAD R2 6
LOAD R1 [R0+R2]
CMP R1 0
BNE check_opposite_corner_3
LOAD R2 2
LOAD R1 [R0+R2]
CMP R1 1
BEQ check_opposite_corner_found
check_opposite_corner_3: LOAD R2 8
LOAD R1 [R0+R2]
CMP R1 0
BNE check_opposite_corner_r
LOAD R2 0
LOAD R1 [R0+R2]
CMP R1 1
BNE check_opposite_corner_r
check_opposite_corner_found: LOAD R0 R2
BRS do_move
LOAD R0 -1
check_opposite_corner_r: PULL R2
PULL R1
RTS
;---------------------------------------------------------------------------------;
; OUTPUT: R0 = -1 if and only if it has found (and done) a move.
check_empty_corner: PUSH R1
PUSH R2
LOAD R2 0
LOAD R0 GB
ADD R0 GRID
LOAD R1 [R0+R2]
CMP R1 1
BEQ check_empty_corner_found
LOAD R2 2
LOAD R1 [R0+R2]
CMP R1 1
BEQ check_empty_corner_found
LOAD R2 6
LOAD R1 [R0+R2]
CMP R1 1
BEQ check_empty_corner_found
LOAD R2 8
LOAD R1 [R0+R2]
CMP R1 1
BNE check_empty_corner_r
check_empty_corner_found: LOAD R0 R2
BRS do_move
LOAD R0 -1
check_empty_corner_r: PULL R2
PULL R1
RTS
;---------------------------------------------------------------------------------;
; OUTPUT: R0 = -1 if and only if it has found (and done) a move.
check_empty_side: PUSH R1
PUSH R2
LOAD R2 1
LOAD R0 GB
ADD R0 GRID
LOAD R1 [R0+R2]
CMP R1 1
BEQ check_empty_corner_found
LOAD R2 3
LOAD R1 [R0+R2]
CMP R1 1
BEQ check_empty_corner_found
LOAD R2 5
LOAD R1 [R0+R2]
CMP R1 1
BEQ check_empty_corner_found
LOAD R2 7
LOAD R1 [R0+R2]
CMP R1 1
BNE check_empty_corner_r
check_empty_side_found: LOAD R0 R2
BRS do_move
LOAD R0 -1
check_empty_side_r: PULL R2
PULL R1
RTS
;---------------------------------------------------------------------------------;
; INPUT: R0 containing the index of the move to make.
do_move: PUSH R2
PUSH R1
PUSH R0
LOAD R2 R0
MOD R0 3
DIV R2 3
LOAD R1 R2
BRS move_to_pos
BRS place_disk
LOAD R0 5000 ; Check whether the disk was placed correctly.
BRS sleep_i
BRS essential_routines
LOAD R0 [GB+SCANNEDCOLOR]
CMP R0 2
BEQ do_move_r
CMP R0 0
BNE do_move_retry
LOAD R0 ' 8'
BRA error_state
do_move_retry: BRS place_disk ; try again
LOAD R0 5000 ; Check whether the disk was placed correctly.
BRS sleep_i
BRS essential_routines
LOAD R0 [GB+SCANNEDCOLOR]
CMP R0 2
BEQ do_move_r
CMP R0 0
BNE do_move_3
LOAD R0 ' 8'
BRA error_state
do_move_3: LOAD R0 ' 3'
BRA error_state
do_move_r: PULL R0
LOAD R1 GB
ADD R1 GRID
LOAD R2 2
STOR R2 [R1+R0]
PULL R1
PULL R2
RTS
;---------------------------------------------------------------------------------;
;INPUT: R0 = wanted color
;OUTPUT R0 = current grid encoded in one word, aka 18 bits.
encode_grid: ; R0 = result
PUSH R1 ; R1 = for counter
PUSH R2 ; R2 = copy of input
PUSH R3 ; R3 = color currently in grid.
LOAD R1 0 ; for counter = 0
LOAD R2 GB ; Use R2 to push the grid pointer to the stack.
ADD R2 GRID
PUSH R2
LOAD R2 R0 ; copy input into R2 so we can use R0 as output.
LOAD R0 0
encode_grid_for: LOAD R3 [[SP]+R1] ; Load color present in the grid in R3
CMP R3 1 ; Color is background, so we can just add it to the result.
BEQ encode_grid_for_add
CMP R3 R2 ; Color is equal to wanted color, so encode to 11.
BEQ encode_grid_for_11
LOAD R3 %010 ; Color is not equal to wanted, ie unwanted, so encode to 10.
BRA encode_grid_for_add
encode_grid_for_11: LOAD R3 %011
encode_grid_for_add: OR R0 R3
CMP R1 8 ; If this is the last iteration, do not multiple, else do.
BEQ encode_grid_for_skip
MULS R0 %0100
encode_grid_for_skip: ADD R1 1 ; increment for counter by 1.
CMP R1 8
BLE encode_grid_for
ADD SP 1
PULL R3
PULL R2
PULL R1
RTS
;---------------------------------------------------------------------------------;
store_prev_grid: PUSH R0 ; grid pointer
PUSH R1 ; counter
PUSH R2
LOAD R1 0
LOAD R0 GB
ADD R0 GRID
store_prev_grid_for: LOAD R2 [R0]
STOR R2 [R0+10]
ADD R0 1
ADD R1 1
CMP R1 10
BLT store_prev_grid_for
PULL R2
PULL R1
PULL R0
RTS
;---------------------------------------------------------------------------------;
@END