当前位置: 首页>>代码示例>>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;未经允许,请勿转载。