Diagram(3pm) | User Contributed Perl Documentation | Diagram(3pm) |
Games::Go::Diagram - Perl extension to make go diagrams similar to printed diagrams
use Games::Go::Diagram my $diagram = Games::Go::Diagram->new (options); $diagram->put($coords, 'white' | 'black', ? number ?); $diagram->mark($coords); $diagram->label($coords, 'a'); $diagram->get($coords); my $new_diagram = $diagram->next;
A Games::Go::Diagram object represents a diagram similar to those seen in go textbooks and magazines. The caller puts 'white' or 'black' stones (possibly numbered), on the intersection selected by $coords. The caller may also mark and label intersections and stones.
putting, marking, labeling and propertying are 'actions'. Actions are provisional until the node method is called. If any provisioanl actions cause a conflict, none of the actions associated with the node are applied, and the node method either calls a user-defined callback function, or returns an error.
When a conflict occurs, the caller should dispose of the current Diagram by getting the information from each intersection and doing something (like printing it). Then the caller converts the Diagram to the starting point of the next diagram by calling the clear method. Alternatively, the caller may save the current Diagram and create the starting point for the next diagram by calling the next method. clear and next may also be called at arbitrary times (for example, to launch a variation diagram).
'coords' may be any unique identifier for the intersection. For example:
my $coords = 'qd'; # SGF format my $coords = 'a4'; # NNGS / IGS style coordinates my $coords = "$x,$y"; # real coordinates my $coords = 'George'; # as long as there's only one George
Options:
The user callback should either save the current Diagram and call <next>, or flush the Diagram (by printing for example) and call <clear>.
If the user callback is defined, a call to node always returns non-zero (the current node number).
The following options are preserved:
As with the clear method, all captured stones are removed, and all overstones are deleted. Pending actions that were not applied due to conflicts are now applied to the next Diagram.
The following options are preserved:
If there is a conflict and a user callback is defined, node calls the callback with a reference to the Diagram ($diagram) as the only argument. The user callback should either flush the Diagram and call clear (to reuse the Diagram) or save the current Diagram, and call next (to generate a new Diagram).
If there is a conflict and no user callback is defined, node returns 0. The user should either:
Calling either next or clear causes the pending collection of conflicting actions to be incorporated into the resulting Diagram.
putting can cause any of the following conflicts:
In certain situations, (notably ko and snapbacks but also some other capturing situations), put stones may become overstones. overstones are stones played on an intersection that contains a stone that has been captured, but not yet removed from the Diagram. There are two kinds of overstones: normal and marked, depending on the state of the underlying (captured but not yet removed) stone.
If the underlying stone is numbered or labeled, the overstone is normal and there will be no conflicts (unless the number is already used!).
If the underlying stone is un-numbered and un-labeled, the Diagram attempts to convert it into a marked stone. If the conversion succeeds, the overstone becomes a marked overstone, and there is no conflict.
The conversion of the underlying stone causes a conflict if:
See the get method for details of how overstone information is returned.
Fails and returns 0 if:
If none of the above, renumber sets the new number and returns 1.
Note that Diagram doesn't use the offset for anything, but external programs (like a converter) can use it to adjust the numbering.
The same label can be applied to several intersections only if they are all labeled within a single node.
If the intersection or stone is already labeled, or occupied by a marked, or numbered stone, or if the label has already been used outside the labeling group, label causes a conflict.
The mark can be applied to several stones only if they are either:
The mark causes a conflict if:
In array context, name returns the current name list. In scalar context, name returns a reference to the list of names.
Note that renumbering a move also renumbers the properties.
If $number is defined and $propName/$propValue are not, property returns a reference to the (possibly empty) hash of property IDs and property Values associated with the move number:
my $prop_value = $prop_ref->{$propID}->[$idx].
If $number is not defined, returns a reference to the (possibly empty) hash of properties stored in the Diagram. Hash keys are the move number, and each hash value is in turn a hash. The keys of the property hashes are (short) property IDs and the hash values are lists of property values for each property ID:
my $prop_value = $all_props_ref->{$moveNumber}->{$propID}->[$idx]
property (when $propName and $propValue are defined) is an action (it is provisional until node is called) because properties are associated with a node in the SGF. However, property never causes a conflict.
Note that capture has no visible affect on the diagram. Rather, it marks the stone so that it is removed when creating the next Diagram.
capture is not considered an action because it cannot cause a conflict or change the visible status of the board.
Unlike capture, remove changes the visible status of the Diagram: the stone is deleted, along with all marks and letters (only the 'hoshi', if any, is retained).
remove is typically used at the start of a variation to remove any stones that are improperly placed for the variation. It is closely related to the AddEmpty (AE) SGF property.
Note that the return value is determined by the game perspective, not the diagram perspective. If a stone is put and later captured, game_stone returns undef even though the diagram should still show the original stone. If a white stone is put and later captured, and then a black stone is put, game_stone returns 'black', and get indicates that a white stone should be displayed on the diagram.
Note also that since put is provisional until node is called. If you use game_stone to check for liberties and captures, it must be done after the call to node that realizes the put.
Only keys that have been applied are returned - an empty hash means an empty intersection.
The hash keys can be any of:
my $intersection = $diagram->get; my $label = $intersection->{label}; my $label_node = $intersection->{$label};
The hash value is a reference to an array of color/number pairs. The colors and numbers were passed to the put method which decided to convert the stone into an overstone.
This is typically seen as notes to the side of the diagram saying something like "black 33 was played at the marked white stone". In this example. the information returned by get describes 'the marked white stone', while 'black' will be the first item in the 'overstones' array, and '33' will be the second.
The hash reference returned by get points to the data in the Diagram object - don't change it unless you know what you are doing.
Always returns the current value of parent (possibly undef).
my $title = "Variation 2 on move " . $diagram->var_on_move . " in " . $diagram->parent->name;
Always returns the current value of var_on_move (possibly undef).
The list is sorted by the order the intersections first had an overstone put on. If there are no intersections with overstones, returns a reference to an empty list.
Returns the current user value (default is undef).
With the current architecture, conflicts within a node are not detected. I think this would probably be malformed SGF. This deficiency could be fixed by adding a 'shadow' diagram to which provisional actions are applied.
Reid Augustin, <reid@netchip.com>
Copyright (C) 2005 by Reid Augustin
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.8.5 or, at your option, any later version of Perl 5 you may have available.
2009-11-01 | perl v5.24.1 |