minefield
Minefield is a connection game. Black tries to form a path of black stones connecting the top and bottom edges of the board, and White tries to form a path of white stones connecting the left and right edges of the board.
Certain glyphs (small patterns of stones) are prohibited. This prevents deadlocks from occurring. One player will win.
Žaidėjų skaičius: 2
Žaidimo trukmė: 17 mn
Sudėtingumas: 1 / 5
Žaisk minefield ir 1361 kitus žaidimus internetu.
Nereikia nieko parsisiųsti - žaiskite tiesiai iš savo interneto naršyklės.
Su jūsų draugais ir tūkstančiais žaidėjų iš viso pasaulio.
Nemokama.
Žaisk minefield ir 1361 kitus žaidimus internetu.
Nereikia nieko parsisiųsti - žaiskite tiesiai iš savo interneto naršyklės.
Su jūsų draugais ir tūkstančiais žaidėjų iš viso pasaulio.
Nemokama.
Taisyklių santrauka
Why have prohibited glyphs? There's a reason for it. Not just because I thought it would be fun. Prohibiting this particulur set of glyphs prevents deadlocks from occurring. It ensures that someone will win, every time.
Minefield is an SPO OOSCG (Single Placement Only, Orthogonal Only Square Connection Game). This is a razor thin subclass of connection games. No moving, removing, flipping, chain reactions, juggling bowing balls on a unicycle... Just adding stones, one stone per turn.
Like all my games, Minefield is finite. It isn't possible to have a cyclic draw. Not every OOSCG is finite. In fact, you might even have a non-finite OOSCG on BGA. I only do finite, as a matter of aesthetics.
Some people are having trouble grasping the premise of this game. Black is trying to form a path connecting the top and bottem edges. White is trying to form a path connecting the left and right edges. If you understand nothing else, understand that.
Some players have observed that, while Minefield's stated goal requires an orthogonally interconnected path, you can actually win with an ortho-diagonally interconnected path. This is not an error in the rule sheet.
I have a collection of 18 OOSCGs (Orthogonal Only Square Connection Game), of which Minefield is one.
But it so happens that in Minefield, once you've formed an ortho-diagonal path, your opponent can't stop you from filling it in and converting it to an orthogonal path.
Also, you would never want to start filling in an ortho-diagonal path prematurely, before you had connected your edges.
So the program declares a winner and ends upon the formation of an ortho-diagonal path, because you've essentially won at that point. This has no effect on the gameplay.
I'm keeping the stated goal in the rule sheet as an orthogonal path, in keeping with all of my other OOSCGs.
OOSCGs is a science and a serious hobby of mine. How to make a square connection game with no possibility of a deadlock or any kind of a draw. Some designers allow for the possibility of an endless cycle of moves between cooperating players. I don't. All of my games, connection and otherwise, are strictly finite.