Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Rules of Go
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==== Connected stones and points ==== '''Definition. Two placed stones of the same color (or two empty intersections) are said to be connected if it is possible to draw a path from one to the other by passing only through adjacent intersections of the same state (empty, occupied by white, or occupied by black).''' The concept of connected stones is used to describe (via the concept of ''liberties'', defined below) the conditions in which stones are ''captured'' by a move. The concept of connected empty points is used only at the end of the game, to define a player's ''score''. In the following position, the stones 1 and 7 are connected by the sequence of black stones 1, 2, ..., 7, in which each stone (other than 1) is adjacent to the stone before it. The empty points ''a'' and ''k'' are connected by the sequence of empty points ''a'', ''b'', ..., ''k'', in which each point (other than ''a'') is adjacent to the one before it. In fact, it is easy to see in this position that all the black stones are connected to each other and that all the empty points are connected to each other. {{Go board 5x5 |ul| u| u| u| ur |lK| J| I| H| rG | l| b4| b5| b6| rF | l| b3| A| b7| rE |b1| b2| dB| dC|drD|24}} The following position can be used as an example for when stones and empty points are connected. {{Go board 5x5 |ulA| b1| uF| uF| b4 | b1| b1| F| w8| b4 | lB| B| w6| E| rE | w5| B| w6| b3| w7 |dlC| b2| w6| w6|drD|24}} In the diagram, stones and empty points are marked with the same number or letter, respectively, whenever they are connected to each other. A ''chain'' is a set of one or more stones (necessarily of the same color) that are all connected to each other and that are not connected to any other stones. Although it is not necessary to define the word ''chain'' in order to state the rules, the concept is important for an understanding of the game. For example, Black and White each have four chains in the diagram above. Black has one three-stone chain, one two-stone chain, and two one-stone chains. White has one four-stone chain and three one-stone chains. It follows from the definitions that any stone on the board belongs to exactly one chain. Furthermore, saying that two distinct stones of the same color are connected is the same as saying that they belong to the same chain.
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Rules of Go
(section)
Add topic