当前位置: 首页>>代码示例>>C#>>正文


C# Square.AlongRank方法代码示例

本文整理汇总了C#中Square.AlongRank方法的典型用法代码示例。如果您正苦于以下问题:C# Square.AlongRank方法的具体用法?C# Square.AlongRank怎么用?C# Square.AlongRank使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在Square的用法示例。


在下文中一共展示了Square.AlongRank方法的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C#代码示例。

示例1: GetPositionsBetween

        // TODO: Refactoroi
        private IList<Square> GetPositionsBetween(Square origin, Square destination)
        {
            var positionsBetweenToReturn = new List<Square>();

            if (origin.AlongFile(destination))
            {
                for (int file = origin.File; file < destination.File; file++)
                    positionsBetweenToReturn.Add(Board.GetSquare(file, origin.Rank));

                for (int file = origin.File; file > destination.File; file--)
                    positionsBetweenToReturn.Add(Board.GetSquare(file, origin.Rank));
            }
            else if (origin.AlongRank(destination))
            {
                for (int rank = origin.Rank; rank < destination.Rank; rank++)
                    positionsBetweenToReturn.Add(Board.GetSquare(origin.File, rank));

                for (int rank = origin.Rank; rank > destination.Rank; rank--)
                    positionsBetweenToReturn.Add(Board.GetSquare(origin.File, rank));
            }
            else if (origin.DiagonallyTo(destination))
            {
                var startingFile = origin.File;
                var startingRank = origin.Rank;

                if (origin.File < destination.File
                    && origin.Rank > destination.Rank)
                {
                    while (startingFile <= destination.File && startingRank <= destination.File)
                    {
                        positionsBetweenToReturn.Add(Board.GetSquare(startingFile, startingRank));
                        startingFile += 1;
                        startingRank -= 1;
                    }
                }
                else if (origin.File > destination.File
                    && origin.Rank < destination.Rank)
                {
                    while (startingFile >= destination.File && startingRank <= destination.Rank)
                    {
                        positionsBetweenToReturn.Add(Board.GetSquare(startingFile, startingRank));
                        startingFile -= 1;
                        startingRank += 1;
                    }
                }
                else if (origin.File < destination.File
                    && origin.Rank < destination.Rank)
                {
                    while (startingFile <= destination.File && startingRank <= destination.Rank)
                    {
                        positionsBetweenToReturn.Add(Board.GetSquare(startingFile, startingRank));
                        startingFile += 1;
                        startingRank += 1;
                    }
                }
                else if (origin.File > destination.File
                    && origin.Rank > destination.Rank)
                {
                    while (startingFile >= destination.File && startingRank >= destination.Rank)
                    {
                        positionsBetweenToReturn.Add(Board.GetSquare(startingFile, startingRank));
                        startingFile -= 1;
                        startingRank -= 1;
                    }
                }
            }

            positionsBetweenToReturn.Remove(origin);
            positionsBetweenToReturn.Remove(destination);

            return positionsBetweenToReturn;
        }
开发者ID:sgtStark,项目名称:ChessEngine,代码行数:73,代码来源:ChessPiece.cs


注:本文中的Square.AlongRank方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。