Fair Chess and Simultaneous Games
The article proposes a simultaneous chess variant to address first-move advantage, outlining rules for conflict resolution and legal moves, aiming to create fair simultaneous games across various types.
Read original articleThe article discusses the concept of fair chess and simultaneous games, addressing the inherent first-move advantage in traditional chess. It proposes a simultaneous chess variant where both players make their moves at the same time, a concept rooted in game theory. The process involves players writing down their moves, revealing them simultaneously, and resolving any conflicts that arise. Various conflict resolution methods are suggested, such as capturing pieces or blocking moves, but the author emphasizes the need for rules applicable to all types of games, not just chess.
The article outlines a general framework for transforming turn-based games into simultaneous ones, focusing on legal moves and conflict resolution. It introduces rules for merging moves based on their legality in different orders, which can be generalized to games with more than two players. The author illustrates these concepts with chess examples, demonstrating how moves can be resolved iteratively until no further decisions can be made.
The computational complexity of implementing these rules is noted, with a focus on achieving polynomial time algorithms for chess. The author expresses interest in developing a game that utilizes these principles, highlighting the potential for creating fair simultaneous games across various game types. The conclusion suggests that while the resulting game may not be the most entertaining, it provides a framework for exploring fairness in simultaneous gameplay.
Related
Using Stockfish to identify ideal squares
This blog post explores using Stockfish to determine optimal squares for chess pieces. The program developed evaluates positions, showing potential for positional analysis despite some limitations and areas for improvement.
The Magic of Participatory Randomness
Randomness is vital in cryptography, gaming, and civic processes. Techniques like "Finger Dice" enable fair outcomes through participatory randomness, ensuring transparency and trust in provably fair games.
The question of what's fair illuminates the question of what's hard
Computational complexity theorists repurpose fairness tools to analyze complex problems. Transitioning from multiaccuracy to multicalibration enhances understanding and simplifies approximating hard functions, benefiting algorithmic fairness and complexity theory.
The Question of What's Fair Illuminates the Question of What's Hard
Computational complexity theorists repurpose fairness tools to analyze complex problems. Transitioning from multiaccuracy to multicalibration enhances understanding of hard functions, simplifying approximations and strengthening theorems in complexity theory.
Professional Poker Players Know the Optimal Strategy but Don't Always Use It
Professional poker players balance game theory optimal strategies with exploitative play to outsmart opponents. AI advancements challenge traditional approaches, pushing players to blend defensive and aggressive tactics for competitive success in evolving poker dynamics.
- Many commenters question the effectiveness of the proposed rules in truly balancing the first-move advantage, with some arguing that the changes may complicate the game unnecessarily.
- Concerns are raised about potential conflicts and draws arising from the new conflict resolution rules, suggesting that they could lead to less engaging gameplay.
- Some participants draw parallels to other games, like tennis and Diplomacy, to illustrate their points about fairness and strategy.
- Several users propose alternative methods to address the first-move advantage, such as allowing Black to have enhanced opening moves or implementing different turn structures.
- There is a general interest in how these rule changes could affect overall strategy and gameplay dynamics, with some suggesting that small adjustments can lead to significant shifts in game behavior.
In tennis, on every point there's a big advantage to the server. Not because he "gets to go first" but because he gets a second chance in some situations. You can prove this: in high level mens tennis the server wins ~70% of points [0] but on a second serve - equivalent to playing without the second chance - he wins almost exactly 50% [1]
This creates a tension in every game where one player is attacking and expected to win, the other player needs to "break" him at least once or twice in the course of the match to win the overall contest.
Chess is similar, but worse because of the possibility of draws. 60-90% of top level chess games end in draws.
Computer chess is even worse again! 95%+ of top computer play ends in draws. Organisers of engine tournaments have solved this: they let the computers play from positions considered advantageous to white, usually where they expect White to score ~75%. They play each position with both White and Black. [2]
This wouldn't be a popular or practical change for human play. But that's not the point, letting White take back his moves à la tennis wouldn't be a change people would accept either. The point is that chess isn't in need of evening out the first-move advantage.
[0] https://www.ultimatetennisstatistics.com/statsLeaders [1] https://www.braingametennis.com/the-art-of-winning-2nd-serve... [2] https://tcec-chess.com/articles/TCEC_Openings_FAQ.html
1. White makes their opening moves - they can move more than one piece, and even the same piece more than once, but: all moves must be legal, and no captures.
2. When White is done, Black has the option to change sides, taking over the white pieces.
3. Regardless of step 2, the player with the black pieces makes the next move.
4. A draw counts as a win for the player with the black pieces.
Thus there are no longer drawn results, and the start must be relatively equal (between a white win and a black win or draw) in White’s estimation.
Turning a game of perfect information into a bluffing and anticipation game is not a minor change. It's a fundamental change of the essence of what the game is.
So for top players (and even more-so for top chess engines), the white advantage isn't enough to translate to a win.
In human play, the top players often need to play suboptimal moves to convert a win. Magnus Carlsen is probably the most famous for doing this. The point is to break away from the well studied lines, and play something that other pros aren't familiar with.
Basically: It's not clear that white's small advantage actually counts for much, at least at the very top tiers of chess.
Changing the game in such a way that white and black odds become even more balanced, would just lead to more draws - which I personally would think makes the game less interesting.
We should have to create many rules to avoid this.
Nice post :)
This is how esports are balanced, and how a game like Starcraft was (at least when I played) more fair than Chess even though there were three "colors" involved (Zerg, Protoss, Terran) and way more "pieces" and complexity.
1 - http://www.hexenspiel.de/engl/synchronous-chess/ 2 - https://www.chess.com/forum/view/general/synchronous-chess
These observations are interesting as they give a test suite, or 'local properties', that can be run against any given simultaneous ruleset to characterize it. It would be fascinating to be able to run an AI to have an idea of how 'optimal strategies' (global properties) would look like in each case and see what relations we can draw from it.
(unfortunately I would assume it is still unreasonably costly to do something like this?)
Related
Using Stockfish to identify ideal squares
This blog post explores using Stockfish to determine optimal squares for chess pieces. The program developed evaluates positions, showing potential for positional analysis despite some limitations and areas for improvement.
The Magic of Participatory Randomness
Randomness is vital in cryptography, gaming, and civic processes. Techniques like "Finger Dice" enable fair outcomes through participatory randomness, ensuring transparency and trust in provably fair games.
The question of what's fair illuminates the question of what's hard
Computational complexity theorists repurpose fairness tools to analyze complex problems. Transitioning from multiaccuracy to multicalibration enhances understanding and simplifies approximating hard functions, benefiting algorithmic fairness and complexity theory.
The Question of What's Fair Illuminates the Question of What's Hard
Computational complexity theorists repurpose fairness tools to analyze complex problems. Transitioning from multiaccuracy to multicalibration enhances understanding of hard functions, simplifying approximations and strengthening theorems in complexity theory.
Professional Poker Players Know the Optimal Strategy but Don't Always Use It
Professional poker players balance game theory optimal strategies with exploitative play to outsmart opponents. AI advancements challenge traditional approaches, pushing players to blend defensive and aggressive tactics for competitive success in evolving poker dynamics.