task_games__chess__marked_piece_destination_count¶
Contract¶
- Domain:
games - Scene id:
chess - Public task id:
task_games__chess__marked_piece_destination_count - Supported
query_idvalues:single - Answer schema:
integer_count - Annotation schema:
bbox_set - Program schema:
count(empty_legal_destinations(marked_piece)); scene=chess; scope=marked_piece_destination_count
Program Contract¶
Program: count(empty_legal_destinations(marked_piece)); scene=chess; scope=marked_piece_destination_count
Candidate set: empty board squares reachable by the marked piece in one normal chess move.
Operands: the marked chess piece, visible board occupancy, friendly blockers, and normal chess movement rules.
Operation: count legal one-move destination squares that are empty; capturable opponent-occupied squares are excluded.
Output binding: answer uses the integer schema; generation binds a unique final answer.
Annotation witnesses: annotation uses bbox_set, one board-square box for each counted empty destination square.
Query ids: single.
Reasoning Operations¶
Families: counting, state_update
Generation Notes¶
- The red outlined square contains the marked piece.
- Friendly pieces block movement.
- Opponent pieces are capture targets and are not counted by this task.
- Capturable opponent pieces are covered by
task_games__chess__marked_piece_capture_count. - The internal prompt/query key is
marked_piece_destination_count; it is not a public query branch.