Search found 1 match
Search found 1 match • Page 1 of 1
- Wed Oct 25, 2017 5:26 pm UTC
- Forum: Logic Puzzles
- Topic: Infinite queens on an infinite chessboard
- Replies: 35
- Views: 23814
We can place the queens using a recursively defined function f(x), which is one-to-one and onto on the set of all integers, such that f(-x) = -f(x) = f^(-1)(x), and g(x) = f(x)-x is also one-to-one and onto. Then place the queens at the coordinates (x, f(x)) for all integers x. The fact that g(x) is...