每一步都是一次 POST /v1/systemone 请求,请求体 = { state, model, questions }。
代码负责枚举全部合法落点并模拟后果,把数字词化成自然语言;Jev 不读数字、不做算术,只读词,返回带概率分布的判断。
rules | "Standard Tetris. Board is 10 columns wide and 20 rows tall. Rows fill left to right; a full row disappears. The game is… |
board_rows_top_to_bottom | ["..........", "..........", "..........", … 共 20 项] |
legend | "# is a filled cell, . is an empty cell. The first row is the top of the board." |
column_heights_left_to_right | [0, 0, 0, … 共 10 项] |
stack_height | "very low" |
holes_in_stack | "none" |
surface | "flat" |
current_piece | "Z" |
next_piece | "T" |
lines_cleared_so_far | 0 |
Which placement of `game.current_piece` should the player choose? Each option describes the board after that placement.
优先级(权重全靠措辞顺序):
每个候选落点一条 criteria,全部用词不用数,含显著事实(唯一/最高/最低等客观比较)。本局第 1 步共 17 个候选,示例 p0:
where | columns 1-3 |
lines_cleared | none |
holes_created | one hole |
holes_uncovered | none |
stack_height_after | very low |
height_change | stack grows by several rows |
surface_after | flat |
wells_after | no deep wells |
strategy | 当前局面该用哪种策略(build_clean / clear_lines / repair_surface / survive) |
board_health | 棋盘健康度打分:Clean / Fine / Rough / Critical |
next_piece_fits | 下一块(next_piece)是否有明显干净的落位 |