Package com.tinygo.logic

Examples of com.tinygo.logic.DocumentedGame

335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
    public void testCgobanSGF() {
        try {
            String data = "(;GM[1]FF[3]SZ[4]HA[0](;AW[bb]PL[2](;W[cc])(;W[aa])))";
            SGFParser parser = new SGFParser(data);
            SGFNode tree = parser.parse();
            DocumentedGame game = new DocumentedGame(tree);
            game.next();
            assertEquals(game.board.get(1, 1), Board.WHITE);
            assertEquals(Board.WHITE, game.colorToPlay);
            game.next();
            assertEquals(game.board.get(2, 2), Board.WHITE);
            game.nextVariant();
            assertEquals(game.board.get(2, 2), Board.NONE);
            assertEquals(game.board.get(0, 0), Board.WHITE);
        } catch (Exception e) {
            e.printStackTrace();
            fail("Unexpected!");
View Full Code Here
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
    public void testUndoAdd() {
        try {
            String data = "(;GM[1]FF[3]SZ[4]HA[0];AW[bb]AB[aa]PL[2];W[cc]))";
            SGFParser parser = new SGFParser(data);
            SGFNode tree = parser.parse();
            DocumentedGame game = new DocumentedGame(tree);
            game.next();
            assertEquals(Board.BLACK, game.board.get(0, 0));
            assertEquals(Board.WHITE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
            game.next();
            assertEquals(Board.BLACK, game.board.get(0, 0));
            assertEquals(Board.WHITE, game.board.get(1, 1));
            assertEquals(Board.WHITE, game.board.get(2, 2));
            game.prev();
            assertEquals(Board.BLACK, game.board.get(0, 0));
            assertEquals(Board.WHITE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
            game.prev();
            assertEquals(Board.NONE, game.board.get(0, 0));
            assertEquals(Board.NONE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
            game.next();
            game.next();
            game.undo();
            assertEquals(Board.BLACK, game.board.get(0, 0));
            assertEquals(Board.WHITE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
            game.undo();
            assertEquals(Board.NONE, game.board.get(0, 0));
            assertEquals(Board.NONE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
        } catch (Exception e) {
            e.printStackTrace();
View Full Code Here
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
    public void testUndoAddEmpty() {
        try {
            String data = "(;GM[1]FF[3]SZ[4]HA[0];AW[bb]AB[aa]PL[2];W[cc]AE[aa]))";
            SGFParser parser = new SGFParser(data);
            SGFNode tree = parser.parse();
            DocumentedGame game = new DocumentedGame(tree);
            game.next();
            assertEquals(Board.BLACK, game.board.get(0, 0));
            assertEquals(Board.WHITE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
            game.next();
            assertEquals(Board.NONE, game.board.get(0, 0));
            assertEquals(Board.WHITE, game.board.get(1, 1));
            assertEquals(Board.WHITE, game.board.get(2, 2));
            game.prev();
            assertEquals(Board.BLACK, game.board.get(0, 0));
            assertEquals(Board.WHITE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
            game.prev();
            assertEquals(Board.NONE, game.board.get(0, 0));
            assertEquals(Board.NONE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
            game.next();
            game.next();
            game.undo();
            assertEquals(Board.BLACK, game.board.get(0, 0));
            assertEquals(Board.WHITE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
            game.undo();
            assertEquals(Board.NONE, game.board.get(0, 0));
            assertEquals(Board.NONE, game.board.get(1, 1));
            assertEquals(Board.NONE, game.board.get(2, 2));
        } catch (Exception e) {
            e.printStackTrace();
View Full Code Here
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
    public void testWhiteToPlay() {
        try {
            String data = "(;GM[1]FF[3]SZ[4]HA[0];W[cc])";
            SGFParser parser = new SGFParser(data);
            SGFNode tree = parser.parse();
            DocumentedGame game = new DocumentedGame(tree);
            assertEquals(Board.WHITE, game.colorToPlay);
            game.next();
            assertEquals(game.board.get(2, 2), Board.WHITE);

            data = "(;PW[White]PB[Black];AB[pn](;B[rr];W[rs](;B[sr])(;B[ss];W[sr])(;B[qr];W[sr])(;B[rq];W[sr]))(;B[rs];W[rr])(;B[sr];W[rr])(;B[ss];W[rr]))";
            parser = new SGFParser(data);
            tree = parser.parse();
            game = new DocumentedGame(tree);
            assertEquals(SGFMove.BLACK, game.colorToPlay);
            game.next();
            assertEquals(SGFMove.BLACK, game.colorToPlay);
            game.next();
            assertEquals(SGFMove.WHITE, game.colorToPlay);
        } catch (Exception e) {
            e.printStackTrace();
            fail("Unexpected!");
        }
View Full Code Here
456
457
458
459
460
461
462
463
464
465
466
467
    public void testKifuFirstMove() {
        try {
            String data = "(;PW[White]PB[Me]AW[cb]AW[db]AW[eb]AW[bc]AW[cc]AW[cd]AW[dd]AW[ed]AW[fd]AW[gd]AW[de]AW[fe]AW[df]AW[ef]AB[bb]AB[fb]AB[hb]AB[ac]AB[dc]AB[ec]AB[fc]AB[gc]AB[bd]AB[hd]AB[be]AB[ce]AB[ge]AB[he]AB[cf]AB[ff]AB[hf]AB[cg]AB[dg]AB[eg]AB[fg];B[](;W[ca]CR[ca](;B[ea]CR[ea];W[ab]CR[ab](;B[aa]CR[aa];W[ba]CR[ba]C[RIGHT])(;B[ad]CR[ad];W[ba]CR[ba]C[RIGHT]))(;B[ad]CR[ad];W[ea]CR[ea]C[RIGHT])(;B[ab]CR[ab];W[ea]CR[ea]C[RIGHT]))(;W[ea]CR[ea];B[ca]CR[ca](;W[ab]CR[ab];B[aa]CR[aa])(;W[da]CR[da];B[ab]CR[ab])(;W[ba]CR[ba];B[ab]CR[ab]))(;W[ab]CR[ab];B[aa]CR[aa](;W[ca]CR[ca](;B[ea]CR[ea];W[ba]CR[ba]C[RIGHT])(;B[ad]CR[ad];W[ea]CR[ea]C[RIGHT]))(;W[ea]CR[ea];B[ca]CR[ca]))(;W[ba]CR[ba];B[ab]CR[ab](;W[ca]CR[ca];B[ea]CR[ea])(;W[ea]CR[ea];B[ca]CR[ca]))(;W[da]CR[da];B[ab]CR[ab]))";
            SGFParser parser = new SGFParser(data);
            SGFNode tree = parser.parse();
            DocumentedGame game = new DocumentedGame(tree);
            SGFNode node = game.kifuFirstMove(true);
            SGFMove move = node.getMoveProperty();
            assertEquals(SGFMove.WHITE, move.color);
            assertEquals(2, move.x);
            assertEquals(0, move.y);
        } catch (Exception e) {
View Full Code Here
473
474
475
476
477
478
479
480
481
482
483
    public void testCompressed() {
        try {
            String data = "(;SZ[3]AW[aa:cb]AB[bc][cc])";
            SGFParser parser = new SGFParser(data);
            SGFNode tree = parser.parse();
            DocumentedGame game = new DocumentedGame(tree);
            byte[] gold = {
                W, W, W,
                W, W, W,
                N, B, B
            };
View Full Code Here
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
    }

    void checkData(String data, byte[][] gold, int[] wCapts, int[] bCapts) throws Exception {
        SGFParser parser = new SGFParser(data);
        SGFNode tree = parser.parse();
        DocumentedGame game = new DocumentedGame(tree);
        int node = 0;
        do {
            for (int pos = 0; pos < game.board.maxPos(); pos++) {
                //SGFPoint p = game.board.xy(pos);
                //System.out.println("Node " + node + " pos " + p.x + "," + p.y);
                assertEquals(gold[node][pos], game.board.get(pos));
            }
            assertEquals(wCapts[node], game.whiteCaptures);
            assertEquals(bCapts[node], game.blackCaptures);

            node++;
        } while (game.next());
        assertEquals(gold.length, node);
    }
View Full Code Here
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
                    // Read and parse file in main thread. It's running too slow in parallel!
                    //display.callSerially(new Runnable() {
                        //public void run() {
                            //try {
                                DocumentedGame game = loadGame(is, offset);
                                //#ifdef debug
                                System.out.println("DONE");
                                //#endif

                                if (game != null) {
                                    if (mode == probMode) {
                                        // skip first "Pass" moves, since we don't have "Pass" in problem mode
                                        SGFNode lastSetupNode = game.kifuFirstMove(true).iterator().prev(false);
                                        if (lastSetupNode != null) {
                                            try {
                                                while (game.kifuLastMove() != lastSetupNode && game.next())
                                                    // DO NOTHING
                                                    ;
                                            } catch (GameException e) {
                                                // DO NOTHING
                                            }
View Full Code Here
1205
1206
1207
1208
1209
1210
1211
        tree = parser.tree;*/
        if (newTree == null)
            return null;

        //System.out.println(SGFWriter.toString(tree));
        return new DocumentedGame(newTree);
    }
View Full Code Here
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
    public void mainMenuNewGame(String white, String black,
            String ruleSet, int size, int handicap, float komi,
            int ts, long mainTime, long byoYomiTime, int byoYomiAttr) {
        display.setCurrent(gobanCanvas);
        resetProblemEnum();
        game = new DocumentedGame(size, komi, ruleSet, white, black);
        game.setHandicap(handicap);
        setMode(playMode);
        setGame(game, true);
        timeSystem.init(ts, mainTime, byoYomiTime, byoYomiAttr);
        timeSystem.start(game.colorToPlay == Board.BLACK);
View Full Code Here
TOP

Related Classes of com.tinygo.logic.DocumentedGame

  • com.sgfj.SGFFloatProperty
  • com.sgfj.SGFIntProperty
  • com.sgfj.SGFMove
  • com.sgfj.SGFNode
  • com.sgfj.SGFNodeIterator
  • com.sgfj.SGFPoint
  • com.sgfj.SGFPointProperty
  • com.sgfj.SGFProperty
  • com.sgfj.SGFPropertyName
  • com.sgfj.SGFTextProperty
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.