def is_valid_sequence(
    n: int,
    moves: list[tuple[int, str, str]],
    adjacent: bool = False,
) -> bool:
    """Check move legality and the final state, not optimality."""
    pass

Simulate the peg states without modifying moves. With adjacent=False, check ordinary rules; with adjacent=True, also enforce adjacency. Return True only if:

Every move is a three-item tuple. Its disk number is an integer in 1..n, not a Boolean. Peg names are A, B or C, with distinct source and target.
The named disk is the source peg’s current top disk. The destination is empty or has a larger top disk.
No direct endpoint-to-endpoint move occurs in adjacent mode.
The final tower is on C in size order, with A and B empty.

Return False if any condition fails. Only n in the stated range and Boolean adjacent are required. moves is a list, but its elements may be malformed. With n = 0 and an empty list, return True.

Legality is not optimality. For one disk, [(1, "A", "B"), (1, "B", "A"), (1, "A", "C")] is a legal completed ordinary transfer and must return True, despite using too many moves. The first two generation tasks check optimal move counts separately; the validator must not substitute a length check for simulation.

Solo assignment 1 — Towers of Hanoi

Sign in

Create account