A Theorem about Primes Proved on a Chessboard

Re:A Theorem about Primes Proved on a Chessboard by joaorico on Tuesday September 06, 2016 @12:53PM (#12437385)

This reminds me of a boardgame, played with 8 queens on a chess board, that was part of the National Mathematical Games Championship when I was in high school (in Portugal). It's called Game of the Amazons [1], and each player owns 4 queens. They take turns moving one of their queens to a valid position and then placing a stone within "sight" of this queen. Stones block cells and the first player to not be able to move any of his queens loses. Quite dynamic, and fun to devise successful strategies.

Cool paper by the way!

[1] https://en.wikipedia.org/wiki/Game_of_the_Amazons

[ Parent | on HN ]

Re:A Theorem about Primes Proved on a Chessboard by IpV8 on Tuesday September 06, 2016 @03:24PM (#12438601)

I played this in College! It was my AI final, each team had to program an AI for this game and then on the last day of classes we pitted our AI's against each other. It was a ton of fun, and taught me a hell of a lot about functional programming and some fancy data structures.

[ Parent | on HN ]

Re:A Theorem about Primes Proved on a Chessboard by akeruu on Tuesday September 06, 2016 @04:37PM (#12439124)

I never heard about this kind of game. So to summarize (if I understood correctly), this would be a variation of the classical 8 queens problem [0] but on a wider board. Very interesting !

[0] https://en.wikipedia.org/wiki/Eight_queens_puzzle

[ Parent | on HN ]

Re:A Theorem about Primes Proved on a Chessboard by schoen on Tuesday September 06, 2016 @06:46PM (#12439811)

It is a little more complicated because the queens move around from turn to turn, they shoot "arrows" to block each other's movements, and they are not forbidden from being in a position to attack one another in the chess sense. Those aren't features of the traditional eight queens problem. (I haven't played the game, I just read the rules online.)

[ Parent | on HN ]