60

I really do mean absolutely no luck. This would disqualify even games like Chess as White has an inherent advantage, winning between 52 and 56 percent of all games. A good test for a game with absolutely no luck is:

  • If player 1 plays again as player 2 and vice-versa, both playing to the best of their abilities, then the second match would be played out exactly the same as the first match.

Is it even possible to design such a game? If so then what would the rules of such a game entail? If not then why?

Pat Ludwig
  • 29,963
  • 6
  • 114
  • 155
Aadit M Shah
  • 735
  • 1
  • 7
  • 7
  • 28
    If we're going to expand the definition of luck to include first-player advantage, such a game would have to have simultaneous turns. However, such games lend themselves to mixed strategies which seem like they would also be covered by generalized luck. – eyeballfrog May 31 '17 at 03:49
  • 40
    Rock Paper Scissors? – Tom77 May 31 '17 at 08:11
  • 2
    Although it's not best suited for 2 players, it's interesting to think about a game like Terra Mystica. There is randomness in the game, but it's all during setup. The game is then pure strategy, playing to get the most out of the setup and out of predicting other players' moves. – Samthere May 31 '17 at 09:29
  • 1
    "If player 1 plays again as player 2 and vice-versa, both playing to the best of their abilities, then the second match would be played out exactly the same as the first match." How about a race? – Colonel Panic May 31 '17 at 10:52
  • Set. (Set card game.) – Wildcard May 31 '17 at 11:01
  • 38
    You say game of skill but it seems you are actually referring to games of strategy. They're NOT the same thing. Most direct competitions (e.g. archery) are games of pure skill with no luck. They don't have strategy—just skill. – Wildcard May 31 '17 at 11:16
  • 3
    "If player 1 plays again as player 2 and vice-versa, both playing to the best of their abilities, then the second match would be played out exactly the same as the first match." Is False. In Ponte De Diavolo, Player A sets the start position, and player B chooses whether that's Player A or Player B's first move; whether he's happy with that start, or he's got a good response. Now, by Zermolo, any Start Position is either a Draw or a Win for B; but there's no reason every game need have the same Start Position, and thus no reason for each game to play out the same – Slow Dog May 31 '17 at 11:45
  • 8
    @Wildcard, though real-life sports have the annoying property that seemingly external conditions may affect the results (at least in theory). Any outdoor sport suffers from luck effects due to weather conditions changing (gusts of wind just as you're releasing the arrow or kicking the ball). In any tournament, the match schedule may give one player/team more rest time than the other or just plain have the game take place at a time more comfortable for one (being sleepy in the morning and a match at dawn). The last one might of course be counted as part of skill. – ilkkachu May 31 '17 at 11:58
  • 23
    @Aadit, "the second match would be played out exactly the same as the first match." -- would it be? If player A won the first match, then B has no reason to play an identical match, but exactly the opposite, they have nothing to lose by doing something completely different. – ilkkachu May 31 '17 at 12:00
  • @eyeballfrog That's definitely not true. Games can have first player advantage, second player advantage, or be, as the question is asking, balanced. – A Simmons May 31 '17 at 13:27
  • 3
    @ASimmons Second-player advantage is isomorphic to first player advantage, so no need to consider it separately. Balance is impossible to prove without demonstrating the optimal strategy, at which point your game isn't all that interesting. – eyeballfrog May 31 '17 at 15:53
  • 2
    Note that any game of strategy can be converted to a game of chance by one player choosing to move randomly. Therefore, a game of strategy that cannot be won by luck is impossible. – Brilliand May 31 '17 at 19:04
  • @eyeballfrog I'm not convinced one has to demonstrate the optimal strategy to prove that perfect play on both sides would lead to a draw. – A Simmons May 31 '17 at 20:33
  • 4
    The question seems to presuppose only games where the players are directly interacting with each other. Any game where the players act independently and then their final results are compared doesn't have the problem. For instance, crossword puzzle contests, where everyone is working on the same puzzle, and the first contestant to solve it wins. – Barmar May 31 '17 at 22:58
  • 2
    @Tom77, what sort of skill/strategy is involved in rock, paper, scissors? – CramerTV Jun 01 '17 at 00:13
  • 2
    @CramerTV Attempting to psychologically anticipate your opponent while evading similar attempts by said opponent. Since people are notoriously bad at true random generation, someone who is adept at reading people and common patterns would likely have a higher than 50% success rate. (Note that this is from someone not good at rock, paper, scissors in any way, so don't ask me to demonstrate, heh). – Lunin Jun 01 '17 at 01:54
  • 3
    @CramerTV: There're actually several papers on that. Here's one: https://arxiv.org/pdf/1404.5199v1.pdf – slebetman Jun 01 '17 at 03:29
  • 2
    "If player 1 plays again as player 2 and vice-versa, both playing to the best of their abilities, then the second match would be played out exactly the same as the first match." Right, because so many chess games end up playing out exactly the same. This premise is completely bogus. – Octopus Jun 01 '17 at 03:48
  • 3
    Your very link to wikipedia points out that some chess grandmasters challenge that black is at a disadvantage and the winning rate for white is not explained, just described – Purefan Jun 01 '17 at 06:15
  • I'd also challenge your bulleted premise. Say optimal play had multiple, equal routes, even an optimal player may choose a different one. Additionally, if it's not known that players are optimal, they may play towards an alternative strategy in the second match, pursuing a weakness in the opponent. e.g. I went war-path first game but saw that the opponent could respond to that skillfully; this time maybe I'll try science path. – Samthere Jun 01 '17 at 09:35
  • 1
    Just play chess twice, once as white and once as black, score it however you like and add the two scores together. – N. Virgo Jun 01 '17 at 13:11
  • 2
    The only winning move is not to play. – Mazura Jun 01 '17 at 17:03
  • @Nathaniel, or play two games at the same time with the boards separated such that the players cannot see them at the same time. Each sits down as white, makes a move, and then goes to the other board to play black, etc. – CramerTV Jun 01 '17 at 17:13
  • 1
    Hmmm. Skill levels change over time - even during a match. In a nearly equally skill level competition, the superior player may vacillate, from A to B to A to B ..., during the contest. At some point, Werner Heisenberg determines the winner. – chux - Reinstate Monica Jun 01 '17 at 17:34
  • 1
    @chux Ah, excellent point! Are the Olympics games of skill or chance? Consider the 100m dash. How much luck is involved in running in a straight line as fast as you can? But at the highest levels, times are so close together (hundredths of a second) that luck must play some role; any minor fluke or fluctuation suddenly can be very important. – Michael Jun 01 '17 at 18:55
  • 1
    @Michael See also Why There Are So Many Ties In Swimming --> "... you couldn’t guarantee the winning swimmer didn’t have a thousandth-of-a-second-shorter course to swim"". – chux - Reinstate Monica Jun 01 '17 at 19:02
  • 1
    The title sounds like a description of Tic-Tac-Toe: "a two player game of skill with absolutely no luck". Why isn't that an answer here? – Mazura Jun 02 '17 at 02:18
  • 2
    As a misinterpretation of the title: I once tried to design a two player game of skill, and I had absolutely no luck. It didn't work out, and I abandoned the game. – Challenger5 Jun 02 '17 at 05:38
  • White having an advantage does not mean that there is any element of luck involved. Both players take each turn with a complete knowledge of the game state, so Chess is a game of pure skill. – trapper Jun 02 '17 at 07:11
  • 1
    @Wildcard you say "Most direct competitions (e.g. archery) are games of pure skill with no luck. They don't have strategy—just skill." The gust of wind that messed up my shot-- isn't that luck? And when I select the one of my two bows that is good at hitting the target but not so good at hitting the bullseye, because I want to safely keep my lead, isn't that strategy? – Don Hatch Jun 03 '17 at 09:54
  • A race? Super Mario Bros. race (video) shows an example, which contains rather little chance. Of course, that is a video game. As an example involving a board game, I would think that Rubik's Race could have chance (by randomizing the colors), but still guarantee equality (by manually applying the results of the random chance equally to both sides), eliminating advantage provided by luck. – TOOGAM Jun 25 '17 at 13:24
  • @TOOGAM A race is not a game. It's a contest. – Aadit M Shah Jun 25 '17 at 21:53
  • @AaditMShah : that web page distinguishes a contest from a game by nature of decision making. e.g., in the Rubik's Race game, decisions get made. From the definition you provided (via hyperlink), I'd say that a race to accomplish a goal can be a game, depending the complexity of the goal. – TOOGAM Jun 25 '17 at 23:27

16 Answers16

120

By Zermelo's Theorem, every 2 player game has one of the following:

  1. Chance
  2. Hidden information (this also includes simultaneous moves)
  3. Either first or second player has a strategy that will guarantee them the win
  4. Both players can guarantee a draw (or force the game to go on forever)

Any game that has (1) is clearly out.

Any game that has (2) is also out if you view chance as our way of modeling information that is unknown. After all, the same rules of probability work whether it's unknown because it will be chosen soon by the roll of a die, or is unknown because an opponent has already chosen something but isn't telling us.

Any game that has (3) is out by your definition, which is reasonable because presumably you choose who goes first by chance, and that determines the winner.

So your only choice is to go for (4): games that under perfect play end in draws (or are infinite). For example, tic-tac-toe can be thought of as fitting your requirements because under perfect play every game is always a draw, no chance involved.

Note that we can't always distinguish games in category (3) and (4) - for example, though you talk about the "inherent advantage" of first in chess, it's entirely possible that this advantage is merely an artifact of our incomplete understanding of perfect play, and that two perfect players might always play to a draw (perhaps even in the same way each time). You can also convert any game with (3) into a game with (4) by wrapping two rounds together in a single game where first player alternates, and declaring the overall game a draw unless one player wins both times. So while chess may or may not fit your definition, two-round-chess does.

ADDENDUM, addressing common objections to this answer:

  • The English definition of "game" is broader and fuzzier than the "extensive-form" definition I am implicitly using to apply Zermelo's Theorem. If you wish to consider other types of games, including timed contests of prowess and trivia, read other answers.

  • My analysis of (2) is certainly controversial - I consider rock-paper-scissors a game containing luck but you don't have to. For more on different views of chance, read about Bayesian vs frequentist schools of thought.

  • I consider simultaneous moves under hidden information because you could imagine that players alternate but the first player's move is hidden until the second player moves.

Benjamin Cosman
  • 11,130
  • 1
  • 31
  • 59
  • 11
    Note that I didn't quite follow the test you provide for "absolutely no luck" because it seems overly restrictive - a game like tic-tac-toe (or two-round tic-tac-toe, perhaps) has absolutely no luck, yet since there are multiple equally good ways of playing to a draw, the game may not be played the same way each time. – Benjamin Cosman May 31 '17 at 03:55
  • 12
    It's worth noting that the world championship games are played with equal numbers of whites and blacks for each player, and I believe the Swiss system is deterministic, so there's not strictly speaking any chance in who gets to be white or black in a tournament. And it's generally thought (though not proven) that chess solves to a draw. – eyeballfrog May 31 '17 at 04:12
  • 2
    After reading your answer I do believe that my definition of games with "absolutely no luck" is indeed overly restrictive. Thanks for the informative answer. It really helped. – Aadit M Shah May 31 '17 at 06:44
  • (In particular, (2) allows rock-paper-scissors.) ​ ​ –  May 31 '17 at 06:49
  • 25
    What if you replaced the coin-flip for player order with an arm-wrestle? Would that count as skill rather than chance? – dbmag9 May 31 '17 at 08:55
  • Why does simultaneous moves involve hidden information? – Wildcard May 31 '17 at 11:01
  • 1
    @dbmag9: I suspect that is covered by a variant of "hidden information", although it is likely the theory does not extend well to physical tests like that and is intended for turn-based games only, where the analysis can be made over something like a Markov Decision Process. – Neil Slater May 31 '17 at 11:50
  • 3
    @Wildcard Because from the viewpoint of one player, the gameplay is non-deterministic. In the case of rock-paper-scissors, you don't know which move the other player is going to make until you've made your own move. – Mr Lister May 31 '17 at 13:08
  • 1
    Good point that the first move advantage in chess probably only exists because of our low skill level. – RemcoGerlich May 31 '17 at 14:38
  • 4
    @Wildcard Also, you can reduce a simultaneous moves game into an alternating one with hidden information - e.g. in rock-paper-scissors, have players take turns, but first player's move is always hidden until second player makes a move. – Benjamin Cosman May 31 '17 at 15:01
  • 3
    Regarding the first move advantage in Chess: Did anyone disprove the hypothesis that with perfect play black can force a mate but white can not, so actually black has a first-move-advantage? – Philipp May 31 '17 at 15:34
  • 1
    Nope! See this other answer: https://boardgames.stackexchange.com/a/31784/15483 – Benjamin Cosman May 31 '17 at 15:35
  • 3
    @Philipp The usual way to prove that is the strategy-stealing argument. However, it does not apply to chess due to the existence of zugzwang positions. – eyeballfrog May 31 '17 at 15:49
  • 3
    @MrLister, I still don't agree that's a general rule regarding simultaneous moves. What about in Basque chess? (For that matter, what about in standard chess?) If you count "not knowing what the other player will do" as "hidden information" then all games have "hidden information" whether simultaneous moves are allowed or not. It just doesn't seem related. – Wildcard May 31 '17 at 20:25
  • 7
    @Wildcard In a simultaneous game, whether you have made a good decision depends on what decision your opponent makes. Consider rock-paper-scissors. Throwing rock was only the correct decision if your opponent throws scissors, which you have no control over. Compare chess, where the correct decision depends only on the current board state, which you have full knowledge of. – eyeballfrog May 31 '17 at 21:39
  • @eyeballfrog, Basque chess has simultaneous moves. So does Set. Neither depends on hidden information. – Wildcard May 31 '17 at 21:55
  • 1
    @Wildcard Basque chess does not have simultaneous moves, and Set is a race, not a game. – eyeballfrog May 31 '17 at 23:32
  • 2
    @eyeballfrog, in Basque chess two players can both make a move at the same time. That fits the English definition of "simultaneous." And if Set doesn't fit your definition of "game," you are not using a standard English definition of the word. If you would argue with me, define your terms. Don't confuse this site with CS stack exchange. – Wildcard May 31 '17 at 23:36
  • 6
    @Wildcard I'll amend my statement to say Set is not a strategic game. Prowess-based games are certainly a thing, but they're not very interesting to analyze. However, Basque chess does not have simultaneous turns. It is two separate sequential games being played simultaneously. The two boards do not affect each other, so there is no meaningful simultaneity to the turns. – eyeballfrog May 31 '17 at 23:42
  • Your point about tic-tac-toe makes me wonder if it would even qualify, because does playing perfect tic-tac-toe really require any skill? What if you (or a computer) just memorized all the correct moves? – Michael May 31 '17 at 23:43
  • 2
    @Michael What if you or a computer memorized every possible chess game? Does that mean chess is no longer a skill game? – corsiKa Jun 01 '17 at 02:16
  • It may even be that with more complete information, Black has a guaranteed win over White in chess. We won't know until we have that complete information. – corsiKa Jun 01 '17 at 02:16
  • I'm glad that I do not "view chance as our way of modeling information that is unknown", making this question relatively trivial. i.e. Yes it's possible - just have simultaneous moves, since not being able to read your opponent's mind is NOT the same thing as chance. – Dronz Jun 01 '17 at 06:53
  • I don't understand why you exclude (2). If players write down their next move(s) in secret, and then execute it simultaniously, that would not include any luck. It could be modelled by random variables, but it would still be pure strategy. – Lot Jun 01 '17 at 10:10
  • 1
    You omitted an important part of the theorem - "in which the players move alternatingly". Which also potentially holds the actual answer to the question. – ndnenkov Jun 01 '17 at 14:12
  • @ndn I do consider the possibility of non-alternating moves - it's rolled into (2) for reasons explained above. – Benjamin Cosman Jun 01 '17 at 14:44
  • 1
    @Lot (and Dronz): Do you consider Rock-Paper-Scissors to be a game that has luck? I do, but you don't have to. Here's further reading on different views of probability. – Benjamin Cosman Jun 01 '17 at 14:44
  • 1
    I've updated my answer to address some of these points. – Benjamin Cosman Jun 01 '17 at 15:12
  • 1
    The exclusion of simultaneous turns as being "hidden information" is a bit weird.. At this point you might want to think about, what constitutes the underlying skill of your game. Physical prowess and chance are out, excluding hidden information/simultaneous turns removes subterfuge/trickery as a possible skill, even though those are part of many games. Any game with alternating turns is inherantly asymmetric in the beginning, thus flawed as a game of skill. Both players could be playing independently from each other, but that is boring. – Chieron Jun 01 '17 at 15:30
  • I have a concern with turning sequential turns into simultaneous turns using (2). This seems to neglect the issue that in chess, for example, the allowed set of actions in one turn may depend on the action in the previous (opponent's) turn. – Sean Jun 01 '17 at 18:34
  • 2
    The conversion I'm proposing is one-way from simultaneous to sequential. So I'm only discussing sequential games directly, but you can consider all simultaneous ones converted into sequential ones. – Benjamin Cosman Jun 01 '17 at 18:37
  • @Chieron Wait, you don't consider simultaneous turns to be hidden information? It's information that could impact your decision making process that you don't know until it's too late. How is that not the definition of hidden information?! – corsiKa Jun 01 '17 at 22:03
  • 1
    @corsiKa: In ordinary chess, your opponent's planned future moves are also "information that could impact your decision making process that you don't know until it's too late". So the distinction is rather subtle. I think the main reason that simultaneous moves create "hidden information" is that they mean that you don't know what game state your move will produce. – ruakh Jun 02 '17 at 04:55
  • 1
    @ruakh Your opponents future moves are not hidden information - if you have perfect play you already know your opponents next moves and your responses if they make imperfect plays. (Turns out no one yet has perfect play in chess, but according to the theorem it is possible...) – corsiKa Jun 02 '17 at 05:48
  • 1
    @corsiKa in simultaneous turns, the other player's move is nothing but a future move - your skill lies in anticipating and counteracting it in the same turn. The gamestate on your next turn is unknown, because they could've taken countermeasures which against the move they expected you to make. Perfect play does not necessarily mean that you know your opponents next moves, there might not always be a perfect strategy. With asymmetric start positions, one player will have an advantage - so the decision who takes what position becomes part of the game and can not be left to chance. In the end.. – Chieron Jun 02 '17 at 09:17
  • .. the solution boils down to playing an even number of chess matches, stopping when one player is in the lead or a set maximum number of matches have been played(with perfect play, this will always end in a draw, regardless of the result of the perfect strategy for a single game of chess) – Chieron Jun 02 '17 at 09:20
  • I'm wondering which of these categories Thud falls into. It's an asymmetric game, but the rules require two matches, one as each side, for a full game. – TRiG Jun 03 '17 at 14:30
  • @Chieron The problem with that claim is that simultaneous moves mean both players don't know what game state their choice will result in. That's exactly why simultaneous moves are equivalent to sequential moves with hidden information: you have to consider that whoever goes second doesn't know what the previous move was. Any game with simultaneous moves is exactly the same as one with sequential moves where player 2 does not know what move player 1 just made. – cpast Jun 03 '17 at 20:55
  • 2
    @Chieron That's why future moves aren't hidden information: "hidden information" in game theory means "you cannot know what the game state will be immediately after your move." In a game without hidden information, you can construct the subtree corresponding to each possible move. You can then analyze each subtree to see what result it'll give you, and pick the move that leads to the most favorable one. In a game with hidden information, this is not possible: you don't know what subtree a move will give you, so you don't and can't know what move will be optimal. – cpast Jun 03 '17 at 21:02
  • 1
    @Chieron, I think you nailed it with: "At this point you might want to think about, what constitutes the underlying skill of your game. Physical prowess and chance are out, excluding hidden information/simultaneous turns removes subterfuge/trickery as a possible skill...." This answer narrows the meaning of "skill" to "ability to mathematically analyze deterministic games." Although CS professors might promote the self-congratulatory belief that that's what skill is, the actual definition is "the ability to do something well; expertise." Skill can include speed. – Wildcard Jun 22 '17 at 21:24
  • I just wanted to say I really liked this answer per the way you broke down what constitutes a game from a CGT perspective. (It might be useful to introduce readers to the concept of intractability, which you definitely reference in plain language understandable to general public.) I'm looking for some informal peer-review of my attempt to define "deterministic games" (still a work in progress) and would greatly value any thoughts or critiques or suggestions you might have on the subject. – DukeZhou Aug 17 '17 at 18:27
  • @Dronz I think some confusion arises because indeterminacy in games is generated in multiple ways: random number generation (such as dice or even card shuffling, in the sense of random order) hidden information (incomplete or imperfect information), and intractability. The first is similar to quantum phenomena, where you can have a result not based on causality (Copenhagen model), and the second is based on inability to confirm positions, opponent choices or decision-making process, and the third is based on the unsolvability of a game by the participants, whether human or algorithmic. – DukeZhou Aug 17 '17 at 18:38
  • Again, this is a really great answer. On reflection, it seems like M games with even-order configurations and two players breaks the theorem as stated here, because in a 2-player even-order game, it is only the second player that can guarantee a draw. (This form of the game relies on symmetry breaking by the second player if they perceive the first player to have make a sub-optimal placement. Failing that, P2 can simple mirror P1 placements to achieve a guaranteed draw:) – DukeZhou Oct 25 '17 at 17:57
  • Which one of these four does the game 'darts' have? (ie the bar game where you throw darts at a dart board) – tuskiomi Oct 20 '23 at 03:25
  • 1
    @tuskiomi See Addendum #1. My impression is/was that OP wasn't asking about things like darts, even though they used the word "game" and darts is a "game" in the most common broad English sense of the word. – Benjamin Cosman Oct 21 '23 at 17:19
41

I find it a bit odd to include the first move advantage in chess as an element of luck -- it assumes that luck is involved in choosing the color, but that choice isn't usually seen as part of the game, more of the tournament organization.

But there are a few ways to fix it.

The most obvious and usual is to play multiple matches, with alternating colors. There is probably still some luck involved, because it may be an advantage to start first or second. World Championship matches use this format, and they switch around the order of who goes first in each 2-game block half way during the match (so it goes A B A B A B B A B A B A ).

Another is to simply accept some number for the built-in advantage to white (say 54%) and instead of always giving 1 point for a win, adjust the scores for winning as black and winning as white so that the expected scores are equal. The math is left as an exercise for the reader and there will be some issues in practice with e.g. Swiss tournaments where people get subtly different scores.

But there is an easier way: simply play two (or another even number) of games simultaneously, one with each color, each with their own clock. By symmetry, there is no advantage for either player, and that was the only luck involved.

This is called Basque chess (video of two players playing it, article about some exhibition Basque chess matches involving some top players).

RemcoGerlich
  • 2,488
  • 1
  • 20
  • 21
  • 1
    If white has an advantage, and you alternate colors, wouldn't you just expect perfect players to win whenever they're white, lose when they're black, and the whole match will be a draw? You need to play an odd number of games to be sure to get a winner, and then you have the problem of which player gets an extra chance to be white. – Barmar May 31 '17 at 22:52
  • 14
    @Barmar There's nothing in the question that says the game must always have a winner. – David Schwartz Jun 01 '17 at 05:34
  • @Bamar: they can also just draw all the games, chess is very likely to be a draw with perfect play. But that is fine. – RemcoGerlich Jun 01 '17 at 07:44
  • 7
    @Barmar That's exactly what should happen, according to the OP's stipulations. If two players have identical skill, and one still loses, it must have been due to randomness, first-player advantage, or something else unrelated to skill. In a game with no luck and no first player advantage, equally skilled players should always finish in a draw. According to the OP's stipulations, a "no luck" game can't have a winning strategy. If it does, it comes down to luck as to which player is in the correct seat to implement that strategy, which contradicts the premise. – Nuclear Hoagie Jun 01 '17 at 13:31
  • @NuclearWang That's not how I interpret the question. It's a game of skill, so the more skilled player should win. There shouldn't be a random factor that might bias the result. – Barmar Jun 01 '17 at 13:34
  • Doesn't Basque Chess have the issue where a less skilled player can just steal moves from their more skilled opponent to force either two draws or a win and a loss? – monoRed Jun 01 '17 at 13:49
  • @monoRed: I suspect that player is going to run out of time on their clock first, but I can't prove it right now. – RemcoGerlich Jun 01 '17 at 14:03
  • @Barmar Of course the more skilled player should always win. We're talking about a game between equally skilled players, which should end in a draw. MonoRed, black copying white's moves one turn later doesn't necessarily end in a draw. If player 2 copies white's moves one game later when he's playing white, the other (more skilled) player can make different moves, meaning the game won't necessarily be a win for player 2. – Nuclear Hoagie Jun 01 '17 at 14:15
  • @NuclearWang Where does the question say anything about equally skilled players? – Barmar Jun 01 '17 at 14:16
  • The question says that it shouldn't matter whether you're white or black, the outcome should be the same. – Barmar Jun 01 '17 at 14:18
  • 1
    @Barmar, the problem of two equally skilled sided always ending in a draft is removed when one player is better right? If one player is more skilled, he can win both games of chess, playing as white and black, so then the score is 2-0 and the more skilled one wins. Only with equal skill it should be 1-1 (twice draw, giving 0.5 points) every time. –  Jun 01 '17 at 14:37
  • @Barmar You started the discussion of "perfect players" which are equally skilled. In a situation of unequal skill, the more skilled player should always win. This situation doesn't tell us much about the game itself, though - a highly skilled player could still always win a game with a minor first player advantage when playing against a low-skill player, even when going second. You can only really assess the "luck factor" of a game when it's played between equally skilled players. The fact that a high-skill player always beats a low-skill player doesn't itself imply the game is all strategy. – Nuclear Hoagie Jun 01 '17 at 14:40
  • @Geliormth The question claims that white has a 52% advantage. If the two players are 51% vs 49% skills, that's enough to allow the lesser player to win if he's white. – Barmar Jun 01 '17 at 14:40
  • @NuclearWang You're right, I did say that. I guess the actual question should be about players whose skill differences are not as great as the bias from the game structure. – Barmar Jun 01 '17 at 14:42
  • @Barmar As Benjamin showed in his answer, the game must have a winning strategy (dependent on player position), or have a force-draw strategy (independent of player position). You can only assess that there's a force-draw when both players are making perfect decisions to arrive at that end state, i.e, they are equally skilled. Playing the game with players of unequal skill can't prove the positive that the game has no luck. It can only prove the negative that it does have luck, if the less skilled player wins. Playing the game with players of equal skill is the only way to prove no luck. – Nuclear Hoagie Jun 01 '17 at 14:47
  • @Barmar, so then it will still result in a draw. Never in a win for the less skilled player. –  Jun 01 '17 at 15:42
27

Consider the game of go, where Black starts, but White gets a number of points (the komi) to balance the advantage of Black's first move. Now, of course this may still not lead to an absolutely balanced game, but the complexity of the game pretty much swamps the remaining difference. From a purely theoretical standpoint the game is still a win for either Black or White (depending on the amount of komi), but as @BenjaminCosman stated in their answer, any two-player game of pure skill has a deterministic result anyway.

If you can't agree on the correct komi, one option is a bidding system like the pie-rule used in Hex: let one player decide the komi, and then the other chooses which color to play.

If that still doesn't satisfy your needs, have the players play an even number of games in a row, with alternating colours, and declare the player with more wins as the winner. (That of course works in chess, too.)

In go, you could also consider playing just two games, and take the total score difference of the two games as the final result. (i.e. if the first game ends with A winning by +2.5, and the second with B winning by +1.5, then A is the final winner, this is harder to do in chess.) However, that does change the strategy of the game, since usually the margin of winning does not matter.

ilkkachu
  • 913
  • 6
  • 9
  • 1
    Go is a finite deterministic game (basically, there's a rooted oriented graph for the moves, each move is an edge, each position is a vertex), so it either has a winning strategy for one or the other player, or has a draw strategy for both players. So assuming the players are Oraculum A and Oraculum B, go does not qualify. And nothing else than assuming they are Oracula makes sense to me (or I may have misunderstood the question). – yo' Jun 05 '17 at 16:41
  • 1
    @yo', Sure. That also rules out all variants of chess, as mentioned in other answers. But to me, a "game of skill" between two entities with power great enough to know the optimal play does not make any sense. In a smaller scale, it doesn't make sense to call tic-tac-toe a game of skill between two adults familiar with it. – ilkkachu Jun 05 '17 at 19:28
  • I think the issue may lie in the subjectivity of non-triviality in regard to games. Games typically designated as non-trivial are those which are intractable to the strongest human player, and more lately, defy computational solution, but to the average 5 year old child, tic-tac-toe is decidedly non-trivial. :) – DukeZhou Aug 17 '17 at 18:53
  • @yo' You can't draw in Go because of the half point komi. Or I think you hear some say a quarter of a point in chinese scoring rules. – snulty Aug 31 '17 at 14:56
  • @snulty: While komi is often an odd multiple of half a point, in order to avoid jigo (a draw), this is not universal. To make the game fair, komi would have to exactly cancel out the amount by which Black would win given perfect play to maximise the score; that means it would be a whole number for almost all rule sets. With this komi perfect play would then lead to a draw. (Of course there is an archaic version of Ing rules in which the result can include all sorts of odd fractions, so that theoretically correct komi for those rules would be fractional.) – PJTraill Dec 17 '18 at 00:11
  • @PJTraill I was reading not long ago that in the Japanese rule set you can have a triple Ko that can effectively leave the game in a draw, which has happened before. – snulty Dec 17 '18 at 09:55
  • @snulty: According to Sensei’s Library (if I remember the source right), Japanese rules specify in this case not a draw but ‘no result’, meaning the game needs to be replayed. Personally I am far happier with one of the more logical, less traditional rule sets, ee.g. Tromp-Taylor or New Zealand. – PJTraill Dec 17 '18 at 11:03
  • @PJTraill I haven’t really had the time to read through all the rule sets and figure out what positions they allow or don’t. Lots of strange examples on 9x9 grids for all the rule sets I think. It seems you can suicide stones in Tromp-Taylor and presumably New Zealand? I’m not sure I like that. I do like the wording of the New Zealand rules though on senseis library, very clean and feels somewhat mathematical in its phrasing. Yeah I guess the difference between a draw and no result depends on scoring if it’s for a league or tournament say. – snulty Dec 17 '18 at 11:16
  • @snulty: I suspect some sets allow suicide to keep down the number of rules, I am agnostic on its desirability, tending to accept it. Simplifying rules complicates tactics! – PJTraill Dec 17 '18 at 11:19
  • @snulty, it doesn't usually matter if suicide is allowed or not, so you can pretty much ignore it. (Mostly it can give ko threats, but apparently there are some situations where it can matter, see https://senseis.xmp.net/?Suicide) And triple-ko is impossible to handle without a superko rule, but that requires memory of the complete game, which is hard to do on a board without good bookkeeping. :/ – ilkkachu Dec 17 '18 at 11:37
13

The card game "Set" may qualify. (Your requirements are awfully stringent but also not precisely defined, so you may disagree on a technicality—but I believe it fits.)

It's described as the "Family game of visual perception," which is a good description. There are no turns. Twelve cards are dealt, and as soon as you see a set you call out "set" and then take the set you saw. Three cards are dealt to replace the three you took, and play continues.

There can be (will be) variations from game to game, obviously, as there are over a thousand distinct sets and several million million possible "boards" of 12 cards. But in any given game, both players have exactly the same information. I wouldn't count the starting board arrangement as "luck" as it doesn't give either player any advantage.

The point you could reasonably question is whether perception counts as a skill. I fully believe it does. It's certainly not susceptible to turn-based mathematical strategy, though!


This game is of the second type listed in this answer.


A sample of a set "board," with notes on the rules:

enter image description here

Wildcard
  • 313
  • 1
  • 11
  • 2
    Ricochet Robots springs to mind from this. The game basically consists of the players staring at a board, and calling out the numbers of moves they require to solve the puzzle currently presented, with the lowest number of course getting to present their solution and winning a point. – ilkkachu May 31 '17 at 11:48
  • 4
    In theory people with the same amount of "skill" would say SET at exactely the same time, something not covered by the rules of the game. –  Jun 01 '17 at 15:50
  • 2
    Similarly, the game Spot It could also fit this criteria. No turns, cards in hand are secret but each will have exactly one symbol matching the card in play (no hand or card is "better" or "worse" than any other). It's all about your skill at parsing sets of symbols quickly and locating matches. – bta Jun 01 '17 at 22:42
  • @bta, that was the ultimate nerd snipe as I'm now knee-deep in the math of the game Spot It. :) – Wildcard Jun 02 '17 at 00:07
  • 1
    But isn't there luck in which card or symbols you happen to look to first? – swbarnes2 Jun 22 '17 at 18:24
  • @swbarnes2 look at them all at once. Spanning your attention across multiple things is a skill. You're not a linear computing machine. – Wildcard Jun 22 '17 at 18:41
  • There's still an element of chance in these games: one player might have a stomachache, or a sore throat, or may simply be a bit hungry. The chaos of life has a large effect on people's ability to play reaction games like this well. – Brilliand Feb 17 '23 at 03:33
  • @Brilliand that's completely irrelevant to skill. Sufficient skill offsets any possible distraction of that type. Go play against a world champion archer while he has a stomachache and not enough sleep; you'll find he can still shoot a bow better than you. So that's skill, not chance. In other words we should define "chance" as "that which cannot be offset by skill." Anyway none of this matters to the question since the OP is really talking about strategy, not skill at all, as I pointed out in another comment. (Also the word used was "luck" not "chance.") – Wildcard Feb 17 '23 at 08:20
10

For perfect symmetry, you need both players to have the same opportunity to make moves. This suggests that either:

  1. Players play the game twice, rotating the first player position between them, with the final score of the game being the score differential between the two games.
  2. Players play a game in which moves are played simultaneously. Either their moves do not directly interact with each other (in which case they are essentially solving the same puzzle and trying to get the better score), or there are rules preventing their moves from interfering with each other (for example, maybe if pieces are close enough together they can't move them any closer), or there are rules that resolve what happens when their moves interfere (for example, pieces which move into the same space on the same turn are removed from the board).

You may consider the simultaneous action in 2 to be a form of luck or hidden information, but it's done in a way that two players of equal skill would always make the same moves against each other, so that seems to meet the requirement. Of course, as pointed out, any perfectly symmetrical game played by players of equal skill is guaranteed to end in a draw, so it's only interesting if the game allows you to distinguish between quite fine differences in player skill - tic-tac-toe is very poor in this regard, since everyone above a fairly low skill level is able to force a draw easily; by comparison, in a game like Go even a small difference in skill level can result in a very deterministic result.

ConMan
  • 11,418
  • 34
  • 57
  • 2
    An example of (1) is the way competitive bridge is played. A team of 4 players plays the same deal of cards twice - once as North-South, and once as East-West. This takes the element of chance out; you truly measure "given the hand you are dealt, how well does your team play it?" - with the final score being the difference between the two games. I suppose that is not a "two player game" though... – Floris May 31 '17 at 16:25
  • 2
    @Floris This is not a "symmetrical" situation. Since top-level card players are skilled in remembering the cards that have been played, on the second play of the hand each player has (potentially) perfect knowledge of all the cards held by all the other players for the whole duration of the hand (I'm assuming that the situation where exactly the same cards are dealt to one of the players in two separate games is too unlikely to be relevant). That was not the case for the first play of the hand. – alephzero May 31 '17 at 20:01
  • 4
    @alephzero sorry if I didn't describe this clearly. A team is four people, called NESW. NS of team 1 play EW of team 2. The score is recorded. The cards (same deal) are then given to EW of team 1 and NS of team 2 (who did NOT see game 1). So they have NO prior knowledge of the cards. Only relative skills of the four players on each team determine the outcome as they are facing the exact same set of cards and their decisions will determine their outcome. – Floris May 31 '17 at 20:08
  • Duplicate bridge removes a lot of the luck that would otherwise be inherent, but there is still plenty left. For example, to make a contract may involve choosing between two 50% chances: you can make a play that wins when West holds the king of spades, or a play that wins when West holds the king of diamonds, but no play wins in both cases. When I play the hand I may choose to hope that West has the king of spades, and at the other table they hope for the king of diamonds. We both played the hand with equal skill, but one of us guesses right and scores better. – amalloy Jun 02 '17 at 17:33
10

Yes, 2 games of chess!

After the first game players switch sides and play again. The slight advantage is completely removed.

The premise in the middle of the OP is incorrect and irrelevant.

Octopus
  • 283
  • 1
  • 7
8

A game that may fit your constraints: Goofspiel, also known as GOPS - Game of Pure Strategy, for 2 or more players.

Goofspiel is played using cards from a standard deck of cards, and is typically a two-player game, although more players are possible. Each suit is ranked A (low), 2, ..., 10, J, Q, K (high).

  1. One suit is singled out as the "prizes"; each of the remaining suits becomes a hand for one player, with one suit discarded if there are only two players, or taken from additional decks if there are four or more. The prizes are shuffled and placed between the players with one card turned up.

  2. Play proceeds in a series of rounds. The players make "closed bids" for the top (face up) prize by selecting a card from their hand (keeping their choice secret from their opponent). Once these cards are selected, they are simultaneously revealed, and the player making the highest bid takes the competition card. Rules for ties in the bidding vary, possibilities including the competition card being discarded, or its value split between the tied players (possibly resulting in fractional scores). Some play that the current prize may "roll over" to the next round, so that two or more cards are competed for at once with a single bid card.

  3. The cards used for bidding are discarded, and play continues with a new upturned prize card.

  4. After 13 rounds, there are no remaining cards and the game ends. Typically, players earn points equal to sum of the ranks of cards won (i.e. Ace is worth one point, 2 is two points, etc., Jack being worth 11, Queen 12, and King worth 13 points). Players may agree upon other scoring schemes.

Matt B.
  • 81
  • 1
  • This is a really interesting suggestion. Even though the game utilizes random order of the prize cards, there is perfect information for any given decision. Even though the sequence of future prize card is unknown, all players have access to the same statistical information as each prize card is revealed. I can see advantage for any player, or luck being a factor in this game. It seems to definitely qualify! – DukeZhou Aug 17 '17 at 19:10
  • Goofspiel/GOPS has hidden information, which is excluded as per point 2 of Benjamin Cosman's answer. – Rosie F Mar 29 '18 at 16:12
6

Each player makes a tower of stacked bricks. Their brick supplies and building areas are separate and identical. The builder of the first tower to topple loses. If both towers are standing after a predetermined amount of time, the builder of the tallest tower wins.

  • 3
    A large truck rumbles by outside, causing your slightly taller tower to fall over just before time is up. Was that bad luck or lack of skill on your part to withstand unexpected vibration? – Michael May 31 '17 at 23:47
  • 1
    @Michael That's a foul, and requires you to start over. Tournaments are not played near roads. – Dronz Jun 01 '17 at 06:49
3

No. Whatever you do to exclude luck from your game, either player may choose to overrule you by making their own choice of moves random. A player who chooses to move randomly (or even uses a random factor to advise their moves when unsure) has introduced chance back into the game, and may win or lose by luck.

Brilliand
  • 500
  • 2
  • 6
  • 3
    Not necessarily. The ability to read your opponent, and the ability to outsmart your opponent, can both be seen as components of skill and/or strategy. In this case, the player decides to make unreadable moves which confuse their opponent through sheer unpredictability, at the expense of their own ability to strategise and plan. Knowing when to discard strategy and act solely at random is a skill-based decision, which makes such confusion-oriented gameplay a valid tactic for outwitting an opponent (it's a mind game, basically, which causes them to doubt their ability to read you), – Justin Time - Reinstate Monica May 31 '17 at 19:14
  • 1
    and a valid tactical choice as long as it falls within the game's rules. It may introduce chance into one side, but this doesn't necessarily cause the game as a whole to fall back on chance (no human can be truly random, so this strategy can and will backfire as soon as your opponent learns to read your "randomness"). – Justin Time - Reinstate Monica May 31 '17 at 19:14
  • 1
    @JustinTime My point is that it is possible for acting randomly to cause an unskilled player to play perfectly, hence "getting lucky". You argue that games with a random player can still involve strategy, and I agree; but the question is whether a game can be found with no luck whatsoever, and in that context, your argument is irrelevant. – Brilliand May 31 '17 at 19:47
  • My argument is also that even a "random" player will become readable over time, due to humans not being truly random unless they use an exterior source of randomness. – Justin Time - Reinstate Monica May 31 '17 at 20:35
  • Assuming that exterior sources of randomness are against the rules (if the intent of the game is to eliminate all chance, then using an outside source to add chance is akin to cheating), then random actions will initially introduce chance (as you initially lose the ability to read your opponent), but won't reduce the game as a whole to chance (since your opponent can't just flip a coin, they'll have to think about what the "random" thing to do is, which makes them predictable; you just need to learn how to read their attempts at randomness). – Justin Time - Reinstate Monica May 31 '17 at 20:35
  • @JustinTime I would argue that "humans are not truly random" is not a strict theorem, and even to the degree that it is true, it does not mean "humans are never random at all". Indeed, I would argue the opposite - that human behavior ALWAYS includes a random factor, simply due to the random environment acting on our bodies. A large part of skill is the ability to mitigate this randomness in yourself. – Brilliand May 31 '17 at 21:59
  • 1
    I agree with this. Richard Garfield (creator of MTG) has a great lecture on chance in games where he says basically the same thing, using chess as an example. He shows that chess does in fact have luck because a player making random moves could theoretically make the right set of moves to beat the best players in the world. – GendoIkari Jun 01 '17 at 02:54
  • @Brilliand My point is that even when people try to be random, it's usually (if not always) still possible to predict what they're going to do, if you know them well enough to be able to read them. To offset this inherent readability, they would need some exterior source of randomness that isn't influenced by their personality. – Justin Time - Reinstate Monica Jun 04 '17 at 16:28
  • @JustinTime Otherwise known as "play the opponent, not the game". I strongly suspect that that would still be too random for the asker's tastes. – Brilliand Jun 05 '17 at 20:46
  • This strategy is really about introducing indeterminacy by attempting to confound the rational, non-random opponent. However, intractability of a game does not constitute luck being involved, merely the uncertainty as to whether a given move is truly optimal. (Winning play in unsolved games may only be deemed "more optimal". Objectively optimal play only exists in solved games, such as Tic-tac-toe.) Unsolved, intractable games such as Chess are still deterministic, regardless of whether the outcome can be predicted. – DukeZhou Aug 17 '17 at 19:18
  • @DukeZhou My argument is about a player (the opponent of the person who chose the "no luck" game) choosing to move randomly, thus introducing an element of chance (he may randomly move perfectly, or throw the game, or anything in between). Against a player of non-perfect skill, this results in the winner being decided by chance (albeit heavily weighted toward the player moving intelligently). – Brilliand Aug 17 '17 at 19:54
  • You're talking about indeterminacy as opposed to luck. Indeterminacy is introduced via: [1] random number generation (such as dice or even card shuffling, in the sense of random order); [2] hidden information (incomplete or imperfect information), and [3] intractability. The first is similar to quantum phenomena, where you can have a result not based on causality, the second is based on inability to confirm positions, opponent choices or decision-making process, and the third is based on the unsolvability of a game by the participants, whether human or algorithmic. – DukeZhou Aug 17 '17 at 20:02
  • Only the first two forms of indeterminacy constitute luck--the third form is a function of complexity, but does not render a game non-deterministic. – DukeZhou Aug 17 '17 at 20:03
  • @GendoIkari Great comment!!! What Garfield claims is theoretically possible and strikes me as true, but it seems to be more of a comment on intractability of non-trivial games. (I'll have to watch the lecture to get the full context, and I doubly thank you for mentioning it.) Garfield is unquestionably one of the most significant game designers in history, and studied combinatorics at University of Pennsylvania. Both factors add weight to his view. – DukeZhou Aug 17 '17 at 20:13
  • @GendoIkari It's technically true that if both players utilize random strategy, the outcome will be based on luck, per the Garfield categorization, but I think Game Theory has an answer. If one player consistently employs a more optimal strategy, they will, on aggregate, win more games. Take the example of classic, iterated Prisoner's Dilemma where one player chooses randomly, but the other player always betrays. The betraying player will always come out ahead of the random player. – DukeZhou Aug 17 '17 at 20:21
  • @GendoIkari AlphaGo heavily utilized Monte Carlo Search Trees, but if the decision-making process was purely stochastic, Lee Sedol would have won every game. – DukeZhou Aug 17 '17 at 20:28
  • @DukeZhou I'm talking about [1]: random number generation (imposed by player choice rather than game rules). As for a more optimal strategy winning more on average, that's standard for games involving both luck and skill; a game with no luck whatsoever would not require multiple games to determine the better player. – Brilliand Aug 17 '17 at 21:06
  • It's a fair point, and Garfield seems to agree with you, but I still feel that it's a distinct form of indeterminacy, arising out of intractability, even if it represents a form of random number generation in this context. That said, worthwhile to bring up, and the questioner certainly does himself extend the definition of non-chance from the standard conception in relation to games. (The Garfield argument is similar to the million monkeys eventually typing Shakespeare;) – DukeZhou Aug 17 '17 at 21:27
  • I think the division of opinions is partly philosophical and partly semantic: "of the forms of indeterminacy, which constitute luck?" For me, true randomness has to be involuntary, and luck is the result of factors beyond the player's control, where statistical analysis of probability cannot be applied, which is distinct from making random decisions and "hoping to get lucky in making the right decisions." Again, this may be a philosophical/semantic distinction. – DukeZhou Aug 17 '17 at 21:37
  • OK-I watched the Garfield lecture on this subject. There is some imprecision in that he is using plain language as opposed to formalize mathematical terms (per CGT). This definition of luck in games is in regard to "uncertainty of outcomes" and is purely a factor of intractability. (It is only a factor in non-trivial deterministic games, i.e. games where the solution is unknown to the participants.) From the standpoint of game mechanics, it is absolutely possible to create a game that involves no luck from a procedural perspective. – DukeZhou Aug 18 '17 at 15:59
  • I am upvoting because the language in the question was imprecise, and this answer is correct and valid from the standpoint of strategy (as opposed to game mechanics) – DukeZhou Aug 18 '17 at 16:00
  • Thanks again for this answer, and please don't take my challenge as an attempt to diminish your correct and valid point. (Just had to work through the concept and understand the context;) It has been quite useful, particularly as I hadn't come across this idea previously, and have had to update my definition of deterministic games (still a work in progress) to discuss the inability to remove luck from unsolved games from the standpoint of strategy/optimal play. – DukeZhou Aug 25 '17 at 01:37
3

A lot depends on your definition of a game for purposes of this question. If you're avoiding chance playing any part then the game must come down to a measure of some skill or trait (or combination thereof). Any such game, being perfectly symmetrical and deterministic, would then proceed to end the same between any two players every game without exception (assuming both players played to the best of their abilities).

For an example I've just invented a game, I call it Who is Taller: Aggregate Edition Two players get their height measured by the same means over a period of time (to account for shifts over the day) and then their heights are compared. No matter which is player 1 or player 2 the results are the same. Obviously this game is probably pretty terrible, my sales are sitting at zero currently, but it meets the criteria you've put forth.

Any game like this would make repeated plays meaningless unless the skill or trait is something a player could improve meaningfully either from playing the game itself or externally. At which point you've discovered all sorts of games involving strength (arm wrestling), dexterity (darts), pattern finding & reflexes (Set, as mentioned in Wildcard's answer), ...etc. Though obviously only one of those examples is actually a board or card game, there are certainly a number of board style games that involve taking physical actions especially involving dexterity, timing, or balance and it mainly depends where you want to draw your line in the sand on what counts and what doesn't.

Of course to truly replicate the starting state in a skill/trait measuring game as mentioned above with the players swapped you'd need to somehow go back in time to run the second test as one player could gain more skill from the playing of the first game than the other, thus shifting the result; but assuming you could do so the result should be the same every time.

The common thread though is that in most of these you're looking at some kind of well structured competition instead of a more traditional game, as the goal is not to allow multiple players to make interesting decisions and try to come out on top with chance of success determined by skill, but rather to see if your abilities are greater when measured in a particular way than that of another.

Lunin
  • 131
  • 2
2

Although your categorization of what constitutes luck is non-standard, I understand perfectly the point you are making regarding first player advantage.

It is possible, and I designed a set of games, [M], which, for certain types of symmetrical configurations, eliminates turn-based advantage, and relies on symmetry breaking.

CONTEXT

For context, symmetry-breaking is a phenomena observed in nature, but, like everything in nature, is related to combinatorics. Most of the thinking on this subject in relation to games will be found in Combinatorial Game Theory (CGT), and combinatorics is at the root of all games discussed on this Stack.

Here are a few articles I found on the subject, to demonstrate I am not alone in pursuing this idea in relation to Game Theory and CGT:

Breaking Symmetry (combinatorial games)
Explaining Diversity: Symmetry-Breaking in Complementarity Games
Symmetry-Breaking in two-player games via strategic substitutes and diagonal nonconcavity: A synthesis
Excerpt from Modern Principles of Economic Mechanics Vol. 1

The underlying problem with combinatorial games (all games are combinatorial;) is that the underlying mathematics are unforgiving: a set of mechanics is either too imbalanced, always resulting in a win for the advantaged player, or too balanced, always resulting in stalemate.

In deterministic games (those which involve no elements of chance such as card shuffling or random number generation, commonly dice) complexity becomes a balancing factor. Chess may have a built-in advantage for the starting player, but has sufficient complexity that the second player may still engineer a win. Complexity partly subjective in that it relates to the tractability of a problem. Games such as chess, which are intractable to the strongest human players, are regarded as non-trivial, but for a 5 year-old, tic-tac-toe is distinctly non-trivial. Tic-tac-toe contains a non-symmetric element in the odd-order (3x3) gameboard, but nevertheless always results in a draw if the game has become tractable to both players. Unlike 8x8 chess, the less symmetrical tic-tac-toe provides no inherent advantage to the starting player where the game is tractable to the participants

SYMMETRY BREAKING IN EVEN-ORDER [M]

In the set of games [M] restricted to 2 players, symmetric grid configurations where n is even n^2(n^2), n^3(n^3), ..., n^2(m^2), ..., allow the second player to draw a stalemate by simply mirroring the placements of the starting player. This is because in such configuration there are an even number of turns and board positions.

However, if the starting player is perceived by the second player to have made a sub-optimal placement, the second player may change their mirroring strategy an attempt to engineer a victory.

In this model, there is no inherent advantage for the starting player. Neither is there an advantage for the second player where the configuration is non-trivial because, while the onus is on the starting player to place optimally, where the gametree is intractable, there is no guarantee that the second player's assessment of a move as suboptimal is correct.

Thus, even-order [M] is solved to infinity in that the second player can always draw a stalemate, it is not solved in the context of objective optimality of a given move over the course of the game, particularly in that the [M] placement constraints, drawn from Sudoku, allow for unpredictable patterns to emerge than can yield advantage if exploited. ([M] has similar emergent complexity to Chess and Go, with less rules and no special conditions.)

This principle may be extended to [M] with any even number of players (2,4,6,...), and becomes more interesting in that only even players (P2, P4, P6, ...) can break the board symmetry, where odd players (P1, P3, P5, ...) do not have this option.

Where is really gets interesting is in even-order [M] with an odd number of players, where number of players is a factor of total board positions, for instance as 3P|2^2(3^2) which yields 36 board positions and 12 placements for each of the three players.

In a configuration like 3P|2^2(3^2), the initiative for symmetry breaking cycles between players, still always on an even-numbered turn, but now all players cycle between odd and even numbered turns:

01: P1
02: P2 (initiative)
03: P3
04: P1 (initiative)
05: P2
06: P3 (initiative)
07: P1
08: P2 (initiative)
09: P3
10: P1 (initiative)
11: P2
12: P3 (initiative)

You'll notice that over 12 turns, 1/3 of the game, each player has the initiative an equal number of times. (This configuration is distinct from even-order configuration with an even number of players because the game cannot result in a stalemate.)

DukeZhou
  • 541
  • 2
  • 9
  • 1
    I'd love to know more about symmetry breaking. It seems quite relevant to the concept of initiative in role-playing games. – Aadit M Shah Aug 15 '17 at 21:29
  • @AaditMShah Initiative in this context is distinct, in that it involves a method of ordering turns (player actions). By contrast, symmetry-breaking relates to partisan strategy in a Combinatorial Game Theory framework, typically in 2-player games, where the second player can mirror the actions of the first player until some point of divergence, based on perception of advantage. That said, I've been thinking about symmetry-breaking in > 2P games, and initiative would certainly interesting to explore in that model. – DukeZhou Aug 16 '17 at 20:30
  • @AaditMShah I updated the answer to provide more context on symmetry breaking as related to games, and provided a concrete example in the set of games [M], which I designed, and which are unique in relation to all other previous games. I linked the [M] rules in the above answer, but you can also find simplified rules here: http://www.mclassgames.com/how-to-play/ – DukeZhou Aug 16 '17 at 23:11
  • Is there somewhere I could learn how to play [M] interactively? Just reading the rules is confusing. – Aadit M Shah Aug 17 '17 at 04:28
  • @AaditMShah My team and I are planning to go into open Beta sometime in September, but if you have an android or iOS device, can add you to the list for the closed Beta (pst me at dukezhou@mclassgames.com) We're not set up for even-order configurations atm, but you can definitely get a sense of how the [M]echanics work with the 9x9 "classic" Sudoku configuration. – DukeZhou Aug 17 '17 at 18:20
1

I believe the game of Connect 6 was designed to eliminate the advantage/disadvantage of going first or second:

According to Professor Wu, the handicap of black's only being able to play one stone on the first turn means that the game is comparatively fair

Guy Schalnat
  • 151
  • 3
1

One way that a game can be made entirely skill- or strategy-based is by meeting the following conditions:

Examples are provided, in the context of a card game. In this fictional card game, each player has their own deck, and draws a card at the start of their turn. On their turn, they are allowed to play one card face-up, and set one card face-down. On their opponent's turn, they are allowed to activate one face-down card. A full turn consists of each player getting a turn; for any full turn N, these are turn N1 and N2; player 1 is the player that goes first (and thus gets 11), and player 2 is the one that goes second (and thus gets 12).

  1. Barring player actions, both players will have identical game states.

    • Both players will have the same resources become available over the course of the game (e.g., both players use the same deck).
    • These resources will become available in a predetermined order, with no chance involved (e.g., both players must stack their decks in the same order).
    • Both players will start with the same number and type of resources available (e.g., both players start with the exact same hand).

    This guarantees that:

    1. Both players have the ability to make the same moves (e.g., if player 1 can play card X on turn 31, player 2 can play card X on turn 32).
    2. Chance is removed from hidden information, as all possibilities are known; the unknown changes from "what do I have to expect" (e.g., which deck is the opponent using) to "which of their resources is this" (e.g., which card out of the cards both players have drawn is it).

      This allows players to infer hidden information using their deductive skills, as their opponent's game state can be inferred from their own (e.g., if player 2 sets a card face-down, then player 1 can look at which cards they've drawn (as they know player 2 has drawn the same cards), and eliminate the cards player 2 has already used, to determine all possibilities for that card; they can then logically determine which of these possibilities it's likely to be).

  2. Turn advantage will be removed. This can be done in multiple ways.

    • Both players can take turns simultaneously; each player plans out their turn, and reveals their actions once both have confirmed that they're done planning (e.g., both players set the cards they plan to use on turn N face-down, and tap their deck when they're done preparing; once both players tap their deck, they both flip the cards they set that turn face-up).
    • All games can be a two-game match, and a player must win both games to win the match; this guarantees that each player will have first-turn advantage, eliminating its effect on the game (e.g., to beat player 1 in a match, player 2 must win both when they go first, and when player 1 goes first).
    • Whichver player has the advantage receives a handicap that compensates for it (e.g., on turn 11, since player 1 gets to draw before player 2 does, they can only play one card instead of the normal two; player 1 will thus have more options available, but player 2 will have more options in play).
    • Going first and going second have distinct advantages; player 1 chooses which of these they get, and by extension, whether they go first or second (e.g., the player that goes first might be able to play 2 cards face-up once during the game, while the player that goes second might be able to set 2 cards face-down once during the game; player 1 decides which of these advantages they want, which also decides turn order).
    • Player 1 has the option of giving up their turn advantage; if they don't, player 2 receives an advantage (e.g., player 1 chooses whether they want to draw on turn 11; if they choose to draw, then player 2 can play a card from their hand during turn 11).

    Out of these options, the first two are the most viable ways to eliminate chance. While the others might work, they are much harder to balance, because the full implications of turn advantage are often unknown during the game's design stage and preliminary testing; they will only truly become known once the pros start milking them for all they're worth (e.g., the advantage of drawing first might be more than enough to compensate for only being able to play one card on your first turn, or only being able to play 1 card might be crippling even if you do draw first).

0

I am going to criticize your definition of Luck.

Yes, it's possible. Take the game Anomiaenter image description here

This game requires players to quickly flip over cards and name items from subjects.

For example, if the card 'Small Dog Breed' was flipped, someone could say "poodle" and take the card for a point.

If your definition of a game without luck is what you're going for, then here is how each game would go:
card flip. "Monkey".
Both players: Marmoset.
Tie breaker.
card flip. "Tree".
Both players: aspen.
Tie breaker ... ad infinitum.

But clearly, luck is inherent in this game, with the knowledge of the players, and the cards which were turned over.

tuskiomi
  • 191
  • 2
  • 7
0

There is a common mechanic that I've always called the 'cake cutting mechanic' although that doesn't seem to be the common name.

lets say player A goes first. Player A then make a move within the rules of the game. Player B then has a choice. They can make a move back and then the game continues as normal. Alternatively they can say they like Player A's move so much they want it and both players swap sides and Player B now has Player A's opening Move and Player A then takes a turn in response to there opening move and from this point players stay with the pieces they have.

So if you perceived white in Chess as having an advantage opening with Kings Pawn forward 2 then the Black player just says 'I want to be white now' and turn the board around.

This is rule is used in Ponte Del Diavolo for example.

StartPlayer
  • 10,576
  • 24
  • 47
  • I think you're referring to the "pie rule". It's a great suggestion, but I don't think it constitutes the elimination of advantage (which in the question is regarded as an element of luck) if the game is intractable, because neither player really knows if the first choice by the first player is truly optimal. – DukeZhou Aug 17 '17 at 19:24
-3

Yes, and it's already been done. It's called InstaGib over LAN. Latency is neglible, weapons always kill when they hit and have 100% accuracy. Everyone has the same amount of life, the same gun, infinite ammo.

You both start at the same time, and you can eliminate the random factor of spawns by placing only 2 spawnpoints.

One for Red, one for Blue. Here's an example. https://www.youtube.com/watch?v=SuRJNn-R1C4

edit: monoRed is right. Excuse my noobness.

  • 5
    This is the board games stack exchange, so video game answers probably aren't what the asker was looking for. – monoRed May 31 '17 at 14:13
  • While true, I'd argue that anything that can be done in such a video game could be replicated in a board or card game, such as by having simultaneous resolution with equal information combined with some kind of dexterity task involved in playing to simulate players who are simply faster at processing information and reacting. Which would seem to count except in the case that not having perfect information might be considered having chance involved. – Lunin Jun 01 '17 at 01:36