Chain - Revision history

Selinger: Added to category Definition

2020-12-28T18:34:12Z

Added to category Definition

Selinger: Converted to new hexboard diagrams

2020-12-08T01:00:52Z

Converted to new hexboard diagrams

Selinger: Clarified definition of "chain" (the old definition was circular), and added an example.

2020-07-05T20:42:20Z

Clarified definition of "chain" (the old definition was circular), and added an example.

Halladba: added cat. connection types

2008-01-31T14:44:26Z

added cat. connection types

Halladba: unified inner links pieces -> piece

2007-12-03T12:00:25Z

unified inner links pieces -> piece

Turing: Changed wording of definition of chain

2005-02-09T07:23:23Z

Changed wording of definition of chain

Turing: Copied/adapted page from http://hexwiki.tk

2005-02-09T07:21:34Z

Copied/adapted page from http://hexwiki.tk

New page

A '''chain''' is a set of [[hex (board element)|cells]] owned by the same [[player]] such that for any pair of them, there is a sequence of cells, all of them in the chain, such that each of them is adjacent to the next. The chain is the strongest connection possible.

← Older revision		Revision as of 18:34, 28 December 2020
Line 10:		Line 10:

	[[category:connection types]]		[[category:connection types]]
		+	[[category:Definition]]

@@ Line 3: / Line 3: @@
 Here is an example of a red chain:
-<hex>R7, C8, Vb2, Vc2, Vd2, Vd3, Vc4, Vc5, Vd5, Ve5, Ve6, Vf6, Ve3, Vf3, Vg2</hex>
+<hexboard size="7x8"
 [[category:connection types]]

← Older revision		Revision as of 20:42, 5 July 2020
Line 1:		Line 1:
−	A '''chain''' is a set of ~~[[hex (board element)\|~~cells~~]] owned~~ by one [[player]] in which every two [[piece\|pieces]] are connected by an unbroken ~~chain~~ of the player~~'s pieces~~. ~~The~~ chain is the strongest [[connection]] possible.	+	Two [[hex (board element)\|cells]] are ''adjacent'' if they are right next to each other. A '''chain''' is a set of cells occupied by one [[player]] in which every two [[piece\|pieces]] are connected by a unbroken sequence of adjacent pieces of the same player. A chain is the strongest [[connection]] possible.
		+
		+	Here is an example of a red chain:
		+
		+	<hex>R7, C8, Vb2, Vc2, Vd2, Vd3, Vc4, Vc5, Vd5, Ve5, Ve6, Vf6, Ve3, Vf3, Vg2</hex>

	[[category:connection types]]		[[category:connection types]]

← Older revision		Revision as of 14:44, 31 January 2008
Line 1:		Line 1:
	A '''chain''' is a set of [[hex (board element)\|cells]] owned by one [[player]] in which every two [[piece\|pieces]] are connected by an unbroken chain of the player's pieces. The chain is the strongest [[connection]] possible.		A '''chain''' is a set of [[hex (board element)\|cells]] owned by one [[player]] in which every two [[piece\|pieces]] are connected by an unbroken chain of the player's pieces. The chain is the strongest [[connection]] possible.
		+
		+	[[category:connection types]]

← Older revision		Revision as of 12:00, 3 December 2007
Line 1:		Line 1:
−	A '''chain''' is a set of [[hex (board element)\|cells]] owned by one [[player]] in which every two [[pieces]] are connected by an unbroken chain of the player's pieces. The chain is the strongest [[connection]] possible.	+	A '''chain''' is a set of [[hex (board element)\|cells]] owned by one [[player]] in which every two [[piece\|pieces]] are connected by an unbroken chain of the player's pieces. The chain is the strongest [[connection]] possible.

← Older revision		Revision as of 07:23, 9 February 2005
Line 1:		Line 1:
−	A '''chain''' is a set of [[hex (board element)\|cells]] owned by ~~the same~~ [[player]] ~~such that for any pair of them, there is a sequence of cells, all of them~~ in ~~the~~ chain~~, such that each~~ of ~~them is adjacent to~~ the ~~next~~. The chain is the strongest connection possible.	+	A '''chain''' is a set of [[hex (board element)\|cells]] owned by one [[player]] in which every two [[pieces]] are connected by an unbroken chain of the player's pieces. The chain is the strongest [[connection]] possible.