當前位置: 首頁>>代碼示例>>C#>>正文


C# AI.PieceExistsAt方法代碼示例

本文整理匯總了C#中AI.PieceExistsAt方法的典型用法代碼示例。如果您正苦於以下問題:C# AI.PieceExistsAt方法的具體用法?C# AI.PieceExistsAt怎麽用?C# AI.PieceExistsAt使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在AI的用法示例。


在下文中一共展示了AI.PieceExistsAt方法的2個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的C#代碼示例。

示例1: GetMoves

    public static List<Coordinate> GetMoves(Coordinate current, AI game)
    {
        List<Coordinate> moves = new List<Coordinate>();

        int file, rank;

        // Up-Right
        for (file = current.File + 1, rank = current.Rank + 1; file < 9 && rank < 9; file++, rank++)
        {
            Coordinate c = new Coordinate(file, rank);
            moves.Add(c);
            if (game.PieceExistsAt(c))
            {
                break;
            }
        }

        // Up-Left
        for (file = current.File - 1, rank = current.Rank + 1; file > 0 && rank < 9; file--, rank++)
        {
            Coordinate c = new Coordinate(file, rank);
            moves.Add(c);
            if (game.PieceExistsAt(c))
            {
                break;
            }
        }

        // Down-Right
        for (file = current.File + 1, rank = current.Rank - 1; file < 9 && rank > 0; file++, rank--)
        {
            Coordinate c = new Coordinate(file, rank);
            moves.Add(c);
            if (game.PieceExistsAt(c))
            {
                break;
            }
        }

        // Down-Left
        for (file = current.File - 1, rank = current.Rank - 1; file > 0 && rank > 0; file--, rank--)
        {
            Coordinate c = new Coordinate(file, rank);
            moves.Add(c);
            if (game.PieceExistsAt(c))
            {
                break;
            }
        }

        return moves;
    }
開發者ID:drusepth,項目名稱:Little-Bobby-Fischer,代碼行數:52,代碼來源:Bishop.CS

示例2: GetMoves

    public static List<Coordinate> GetMoves(Coordinate current, AI game)
    {
        // The pawn, himself
        Piece pawn = game.GetPieceAt(current);

        // List of moves this pawn can make
        List<Coordinate> moves = new List<Coordinate>();
        
        // Rank multiplier dependant on piece color
        int color = game.IsWhite(pawn) ? 1 : -1;

        // If a pawn is in its corresponding start position (hasn't moved), then we want to handle
        // it being able to move forward two spaces in addition to just one.
        if (pawn.ExpectedRank == (color == 1 ? 2 : 7))
        {
            // There must be no pieces in the way to move forward two
            if (!game.PieceExistsAt(new Coordinate(current.File, current.Rank + 1 * color)) &&
                !game.PieceExistsAt(new Coordinate(current.File, current.Rank + 2 * color)))
            {
                moves.Add(new Coordinate(current.File, current.Rank + 2 * color));
            }
        }

        // Straight move forward 1
        if (!game.PieceExistsAt(new Coordinate(current.File, current.Rank + 1 * color)))
        {
            moves.Add(new Coordinate(current.File, current.Rank + 1 * color));
        }

        // Attack!
        moves.AddRange(GetAttackMoves(current, game));

        // En Passant
        moves.AddRange(EnPassant(current, game));

        return moves;
    }
開發者ID:drusepth,項目名稱:Little-Bobby-Fischer,代碼行數:37,代碼來源:Pawn.CS


注:本文中的AI.PieceExistsAt方法示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台,相關代碼片段篩選自各路編程大神貢獻的開源項目,源碼版權歸原作者所有,傳播和使用請參考對應項目的License;未經允許,請勿轉載。