Chess Sliding Ray Squares
Enumerate an empty-board sliding ray in a supplied unit grid direction, excluding the origin and stopping at the board edge.
Description
Enumerate an empty-board sliding ray in a supplied unit grid direction, excluding the origin and stopping at the board edge.
A sliding ray follows one unit direction from a chess square until the board edge. Geometry alone omits blockers and checks.
When to use this tool
Enumerate an empty-board sliding ray in a supplied unit grid direction, excluding the origin and stopping at the board edge.
- Prepare the supplied square, dx, dy fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter square, dx, dy. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.squares. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Parse lowercase square a1 through h8. Require dx and dy in -1,0,1 with at least one nonzero, then repeatedly add the direction and emit in-board squares, excluding the start.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| square | square. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| dx | dx. | Integer from -1 to 1 inclusive |
| dy | dy. | Integer from -1 to 1 inclusive |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.squares | The squares list in the ordering and representation described above. |
{
"input": {
"square": "f6",
"dx": 1,
"dy": 1
},
"output": {
"result": {
"squares": [
"g7",
"h8"
]
}
}
}Limitations and assumptions
- No piece type, occupied square or legal-move rule is applied. Every square along the chosen unobstructed ray is returned.
- Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
- Lists are limited to 128 entries. JSON text must meet bounded size and depth checks, and numeric outputs beyond the safe finite magnitude are rejected. Exact large integers use decimal strings.
- Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.
Alternative or Complementary methods
Use a game-state-aware rules engine when occupancy, legal moves or scoring rules matter. These operations calculate coordinates, local geometry or supplied ledger totals without inferring a complete position.
References
Similar or alternative tools
- Chess Knight Local Destination Count
Enumerate the count of one-step knight destinations on an empty 8×8 board; excludes occupancy, checks and legal-position state.
- Chess Knight Local Destination List
Enumerate the squares for one-step knight destinations on an empty 8×8 board; excludes occupancy, checks and legal-position state.