Lines of Action
Lines of Action starting position
Abstract strategy game
|Setup time||< 1 minute|
|Skill(s) required||Strategy, tactics|
The game was given wide dissemination and positive publicity by its inclusion in Sid Sackson's book A Gamut of Games (1969), but for many years no stable playing community developed to explore the strategy to any depth. Only starting in the 1990s has any deep understanding of the game evolved.
In the last few years, not only has the play of the best humans risen dramatically, but simultaneously excellent computer programs have emerged. The level of play is improving both among humans and computers, but for the present the strongest LOA-playing entity in the world is the program MIA. MIA took first place in the 8th Computer Olympiad (2003), 9th Computer Olympiad (2004) and 11th Computer Olympiad (2006).
The best human players are probably Jorge Gómez Arrausi and Gianfranco Buccoliero (winner of the largest loa tournament to date). Jorge has played competitive games against top computer programs, but has not been triumphant in recent matches.
Claude Soucie, the inventor of LOA, died just as his game was beginning to reach a critical mass of interest. Some of the finer points of the rules are just now being standardized, without the benefit of appeal to Soucie. In all situations which were discussed by Sackson, his presentation is now generally accepted as authoritative.
Lines of Action inspired Sid Sackson to develop another game, entitled Fields of Action.
The object of the game is to bring all of one's checkers together into a contiguous body so that they are connected vertically, horizontally or diagonally (8-connexity).
- Players alternate moves, with black having the first move.
- Checkers move horizontally, vertically, or diagonally.
- A checker moves exactly as many spaces as there are checkers (both friendly and enemy) on the line in which it is moving. For example, black may open with c8-c6. Black's checker moves two spaces because there are two checkers in the line (c8-c1) in which black is moving.
- A checker may jump over friendly checkers, but not over an enemy checker.
A checker may not jump over an enemy checker. Thus in the diagram below, white can't play a6-d6, even though there are three checkers in row 6. White might instead play a6-c4, moving two spaces because there are two checkers in the diagonal (a6-f1) in which white is moving.
A checker may jump over friendly checkers. Thus black may continue with e8-b5, jumping his own checker. He moves three spaces because there are three checkers in the diagonal (a4-e8) in which he is moving.
A checker may land on a square occupied by an enemy checker, resulting in the latter's capture and removal from the game. For example, white may play h3-f1, capturing the black checker on f1.
A player who is reduced to a single checker wins the game, because his pieces are by definition united. If a move results, due to a capture, in each player having all his pieces in a contiguous body, then either the player moving wins, or the game is a draw, depending on the rules in force at the particular tournament.
In the original 1969 edition of A Gamut of Games, simultaneous connection was described as a draw. In the second edition, the rules were changed to declare this a win for the player moving. Here is Sid Sackson's note in the preface to the second edition:
"Claude Soucie and I are all that remains of N.Y.G.A. At his request, I have corrected an error in the rules for LINES OF ACTION, eliminating possible draws."
However, despite the expressed intention of the inventor of LOA, most present day tournaments score simultaneous connection as a draw.
In the diagram below, white to move could capture with h8-f6, resulting in both players having entirely connected formations. However if the tournament rules declare this a draw rather than a win, white is better off to play g5-g8 which wins unambiguously.
The game can become quite tactical in open positions where the checkers on both sides are mobile. The strategic depth of the game, however, derives to a large extent from blocking strategies designed to limit the opponent's mobility. It can be very advantageous to pin one or more enemy checkers against the side of board by moving in the second row or column.
Having more checkers is usually an advantage, because they can limit the opponent's options as they mass together. On the other hand, material considerations are not all-important, because having fewer checkers also means having fewer to unite.
The above moves illustrated the rules, but not necessarily good play. The following moves are more typical of expert play.
Black plays b1-b3. The checker moves two squares vertically, because there are two checkers in the file: b1 and b8. This move gives white no opportunity to capture, and threatens to hem in the pieces on the a-file.
White moves h4-f2. The checker moves two spaces because there are two checkers in the diagonal: h4 and e1. White threatens the mobility of black's checkers in the bottom row.
Black plays d1:a4, jumping over his own checker (which is permitted) and capturing the white checker at a4. Note that black moved three spaces, as there were three checkers in the diagonal: a4, b3, and d1.
It isn't clear whether the capture is advantageous or not. Black does now have an extra checker, but the move didn't do much to block white or build a central mass for black. Usually early captures on the edge are not especially powerful, whereas early captures in the center are extremely good.
White plays h2-e2, continuing the blockade of the first rank. The checker moves three squares, jumping over a friendly checker. White, despite the substantial disadvantage of moving second, apparently is in the lead now due to the reduced mobility of black's first-row checkers. White will soon play a2-d2, continuing to build his own bridge and forcing black's checker on e1 to move sideways if it wants to join the game. It hardly helps for black to try to escape with e1-c3, because that allows white to capture with a5:c3.
Example winning move
In the diagram below, white has made a move that connects all his pieces while black is still at least two moves from such a state. Thus, white has won the game.
- 1997: Fred Kok (Netherlands)
- 1998: Hartmut Thorsden (Germany)
- 1999: Fred Kok (Netherlands)
- 2000: Jochen Drechsler (Germany)
- 2001: Koichi Nicholas (United Kingdom)
- 2002: Fred Kok (Netherlands)
- 2003: Koichi Nicholas (United Kingdom)
- 2004: Fred Kok (Netherlands)
- 2005: Koichi Nicholas (United Kingdom)
- 2006: Fred Kok (Netherlands)
- 2007: Tim Hebbes (United Kingdom)
- 2008: James Heppell (United Kingdom)
- 2009: Tim Hebbes (United Kingdom)
- 2010: Andres Kuusk (Estonia)
- 2011: Tim Hebbes (United Kingdom)
- 2012: Peter Horlock (United Kingdom)
- 2013: Ankush Khandelwal (United Kingdom)
A variant of Lines of Action with a different starting position was also proposed by Soucie and is known as Scrambled Eggs.
- LoA on German Spiel des Jahres official website
- Mind Sports Olympiad LOA Results http://www.boardability.com/result.php?id=lines_of_action 10 July 2010
- http://brainking.com/en/GameRules?tp=86 Brain King Web page: Scrambled Eggs Rules
- Sackson, Sid. A Gamut of Games. ISBN 0-486-27347-4
- Schmittberger, R. Wayne. New Rules for Classic Games. ISBN 0-471-53621-0
- "Lines Of Action - Computer World Champion, including academic research" https://dke.maastrichtuniversity.nl/m.winands/loa/
- Rules for Lines of Actions with example diagrams
- BrainKing play LOA online
- Little Golem play LOA online