Search - B-ISDN

Search - B-ISDN - List

[Mathimatics-Numerical algorithms] 钻石棋问题 DL : 0: 独立钻石棋问题描述：有一棋盘，上有44个钻石棋子，有一位置空缺，棋盘初始状态如下：　　　１１１　　　１１１　　　１１１１１１１１１１１１１１１１０１１１１１１１１１１１１１　　　１１１　　　１１１　　　１１１其中，0表示没有放置棋子， 1表示放置。规定走法如下： a. 任一棋子可越过一相邻棋子（紧相邻）跳到一空缺位置，并吃掉越过的棋子（从棋盘移处）如，走一步后棋盘状态：　　　１１１　　　１１１　　　１１１１１１１１１１１１１１１１１００１１１１１１１１１１１　　　１１１　　　１１１　　　１１１ b. 最后只留下一个棋子在棋盘上，并且位置在正中央。要求：用程序得出正确走法。输入：无输出：每一步移动后的棋盘状态，格式如上。-independent diamond chess Problem description : a chessboard, there are 44 pieces of diamonds, a position vacant chessboard initial state as follows : 111111111 111101111 111111111 which, 0 no place pawn, a place said. Provisions in law are as follows : a. as a pawn to be crossed an adjacent piece (bear adjacent) jumped to a vacant position, and eaten across the pawn (shift from the chessboard) If, after the chessboard go one step further state : 111111111 111111111 111110011 111111111 111111111 b. leaving only a game son on the chessboard, and in the middle position. Requirements : getting the correct procedures in law. Input : None output : each step of the chessboard mobile state, the format above.
Date : 2025-12-19 Size : 6kb User : 欧