Here's a problem that was posed to me but I haven't seen anything about it anywhere online! I'm beginning to wonder if I'm just getting played!
You have a chessboard and sixteen pawns. The puzzle is to have all sixteen pawns on the board such that no three are collinear (three in a row). It can be considered with Cartesian coordinates; the three pawns can't make the same slope, even at unequal distances (ex: 0,0 & 1,2 & 3,6 is not allowed).
I'm thinking that the solution must be so complex that there must be a logic, strategy, or algorithm for this. Could people help me out? Thanks!