idea for chess variant: the two armies are positioned infinitely far away from each other, on an infinite chessboard, one being infinitely far to the side and down (not sure how bishops work currently)
@Zacharý none of the capturing rules change, the only movement rule that changes is that you can only move to a point within the final square of the piece's movement
is there any difference between uncountable and countable systems for any of these related chess ideas?
also i think rationals will be useful for my projective chess variant, if you want to move a rook infinitely, but to a different amount of infinity than the opponents board
The objective is to print a graph from an array of numbers, of the design below. Printing the X and Y scale exactly as in the "design", with padding, is part of the challenge. The input array of numbers can be of virtually any range of integers in X and Y, though I would suggest keeping it small ...
statement flushing (basically good asi), implicit array creation (since [ is a function call in Attache), value discarding via parens ((a, b, c) being equal to c), inbuilt currying syntax, bracketed lambdas ({ ... })
The way I see it, without the leading µ it just executes the first three links, then the µ forces the parser to move on without regrouping the previous links, and therefore С can't group the previous two links
