确定下一个状态谓词序言

Question

我有一个包含 5 个元素、2 个黑色元素、2 个白色元素和一个空点（“v”）的列表。 我有一个由 [w, w, v, b, b] 表示的状态，其中有白人玩家和黑人玩家。

每个玩家轮流玩，并且可以向前移动他的一个元素。他无法将其向后移动。

我想写一个谓词来确定玩家 P 玩后所有可能的状态。

例如，我们将有：

next_state([w, w, v, b, b], W, L).
 L = [v, w, w, b, b];
 L = [w, v, w, b, b];
 false.

但我不知道如何进行。 谢谢

Answer 1

如果跳过同名的件规则仅限于向前移动2个位置，那么这应该足够：

player(w, forwards).
player(b, backwards).


state_player_next(State, Player, State1) :-
    player(Player, Direction),
    (   Direction == forwards ->
        state_player_next_(State, Player, State1)
    ;   reverse(State, StateReverse),
        state_player_next_(StateReverse, Player, State1Reverse),
        reverse(State1Reverse, State1)
    ).


% Make move in correct direction, leaving behind space (v)
state_player_next_([Player, Next|T], Player, [v, Player|T]) :-
    % Can't take own piece
    dif(Player, Next).

% Jump over the player's 1 other piece
state_player_next_([Player, Player, Next|T], Player, [v, Player, Player|T]) :-
    % Can't take own piece
    dif(Player, Next).

% Piece (or space) stays where it is
state_player_next_([P|T], Player, [P|State1]) :-
    state_player_next_(T, Player, State1).

结果：Swi-Promog：

?- state_player_next([w, w, v, b, b], Player, LstNext).
Player = w,
LstNext = [v,w,w,b,b] ;
Player = w,
LstNext = [w,v,w,b,b] ;
Player = b,
LstNext = [w,w,b,b,v] ;
Player = b,
LstNext = [w,w,b,v,b] ;
false.