Cluster pays slots: which symbols belong to the same group?

Start with the connection rule

In an adjacent-symbol cluster game, matching symbols must connect in the way the rules allow. Horizontal and vertical neighbours share an edge. Diagonal neighbours touch only at a corner, which may not qualify. Read that distinction before counting symbols across a grid.

BGaming’s published Aztec Clusters page provides one concrete example: it describes groups of at least five matching symbols connected horizontally or vertically. That is an example of a rule, not a statement that every cluster game uses five symbols or the same grid.

A provider’s description of one release also does not establish its availability at a particular GB operator. This guide explains a mechanic and contains no claim that the example game can be played through this publication.

Count the group, not every matching symbol on the screen

Imagine a neutral five-by-five example grid with five blue symbols connected through shared edges. A sixth blue symbol elsewhere, separated by other colours, is not part of that connected group. Its colour alone does not bridge the gap.

Now move one symbol so that it touches the group only diagonally. If the example rule allows only horizontal and vertical connections, the diagonal symbol still does not join. The arrangement matters alongside the number of matching symbols.

Our diagram is a hypothetical rule illustration. It is not a game screenshot or a record of a paid round. No payout amount is assigned because a real game’s paytable would determine the value and minimum qualifying group.

A cascade describes what happens after evaluation

Some games remove winning symbols and refill the spaces. The new arrangement may then be evaluated again under the game’s rules. That replacement process is often called a cascade, tumble or refill, depending on the release.

The replacement does not explain how the original win was recognised. A game can use a refill mechanic with another payment rule, and a cluster title can define its refill conditions differently. Do not treat the two labels as interchangeable.

The next arrangement may contain no qualifying group. A sequence of replacements is not a promise of continuing wins, and several evaluations inside a paid cycle should not automatically be counted as several separately purchased spins.

Wilds and special cells can change the reading

A wild may substitute for selected ordinary symbols, but the release decides its exclusions and behaviour. Sticky positions, expanding symbols and multipliers can also change what is evaluated or how the resulting value is calculated.

Keep symbol recognition and multiplication separate. First establish whether a group qualifies. Then read which multiplier applies, whether more than one can combine, and when it resets. A large displayed modifier does not create a win where the qualifying condition is absent.

Do not borrow a maximum win, trigger count or modifier from a similarly named sequel. A mechanic category is not a single game specification. This page deliberately leaves release-specific figures to the relevant rules rather than inventing one standard cluster paytable.

Read a complete example in stages

In the hypothetical grid, identify the connected blue group and count its members. Compare that count with the example’s stated minimum of five. If the game rules say qualifying groups disappear, remove only the positions those rules identify.

After replacement, evaluate the new arrangement afresh. A symbol that was isolated before may now connect, while a previously useful position may hold another colour. The earlier group does not carry forward merely because the screen is still part of the same sequence.

Finally, read the round summary to distinguish total return from the stake used to start the cycle. A return is not automatically profit. If a game returns less than the amount staked, the cycle has still reduced the balance.

The mechanic does not predict a session

A connection rule explains the meaning of a result already displayed. It does not reveal the next grid. Large playing areas, frequent animation and repeated refills can make activity look continuous without establishing a particular likelihood of profit.

For a GB online slot, the applicable stake ceiling is a separate product rule. It does not turn the maximum permitted amount into a suitable stake. A deposit cap, a time reminder and a break each address a different part of spending or access.

If the paytable cannot explain whether a symbol joins a group, stop and consult the game’s help. Guessing from the artwork is less reliable than checking the specific release. There is no need to buy another round to find that explanation.

Treat connection as a path through matching neighbours

A connected group can bend. With the horizontal-and-vertical rule used here, matching symbols belong together if you can trace a path between them through shared edges. That path may turn a corner or double back. What matters is whether each step reaches another matching neighbour: a gap or a corner-only contact cannot complete the path under this rule.

For a hypothetical sketch, draw three blue symbols in a horizontal row and extend two blue symbols down from one end. All five can belong to one connected L-shaped group under that example. Moving the lower two away so they meet the row only diagonally breaks the edge connection. The exercise explains membership without assigning a symbol value or claiming that every cluster title uses the same shape rules.

Count a symbol once even when it has several neighbours

Count positions, not contacts. A symbol touching two neighbours still occupies one position in the group. In a compact block, many symbols share several edges, so counting those edges would quickly exaggerate the cluster size. You can trace the connections in any convenient order, provided you mark each matching position once and do not count it again when another route reaches it.

Imagine a hypothetical two-by-three rectangle of matching symbols. It contains six positions even though several internal edges connect them. Tracing from one corner can reach every member through permitted neighbours, but the trace should mark each position only once. This is a counting method for the illustration, not a claim that a six-symbol group has a particular payout. The actual paytable still supplies the qualifying band and award.

A hole does not automatically divide an edge-connected ring

A different symbol in the middle need not split a group. Matching symbols can still connect around it, much as a path can go around an obstacle. Follow the shared edges between the surrounding positions to see whether they form one group. The centre stays outside the count even when the matching symbols appear to enclose it completely.

For a hypothetical board, draw a ring of matching edge-connected positions around one different symbol. Count the ring positions as distinct members if the example rule allows their connections, and leave the centre out. Do not fill the centre in the count simply because it lies inside the outline. Conversely, if a break separates the ring into disconnected pieces, evaluate that separation rather than treating the drawn outline as a bridge.

Keep separate groups separate, even when the symbols match

The same symbol can appear in several separate groups on a board. Count each connected group first; adding every occurrence across the screen can produce a total that no individual cluster reaches. Before comparing a count with the minimum or a paytable band, check that there is a permitted path between all the positions you have included. Matching colour alone is not enough.

In a hypothetical example, place three connected blue symbols in the upper area and another connected pair far below, with other symbols between. Five blue symbols are visible, but neither separated component reaches the example minimum of five by itself. The result illustrates why summing the colour everywhere would be an error. It does not determine how a specific game handles separate qualifying groups or simultaneous awards; those instructions need their own rules.

A minimum threshold and a size band are separate paytable inputs

The minimum answers a simple question: is this group large enough to qualify? Paytable bands answer the next question: what is that qualifying size worth? A minimum tells you nothing about the award for a much larger group. Equally, an example of a large award cannot tell you whether a smaller connected set qualifies. Both entries need to be read in the actual paytable.

For a hypothetical paytable-reading exercise, first compare the actual group count with the stated minimum, then locate the entry covering that count. Do not assume an award grows by a fixed amount for every additional symbol unless the table says so. A release may use a different set of bands or another structure, so the five-symbol Aztec Clusters example should remain an example of its published threshold rather than a universal cluster schedule.

The grid dimensions do not define the minimum group

A larger board contains more positions, but its dimensions alone do not establish the minimum cluster. A five-by-five teaching diagram is a neutral space for demonstrating connections. It is not evidence that a real title has twenty-five active positions, uses a five-symbol threshold or pays for every connected shape shown in that diagram.

Try drawing the same connected five-symbol shape on two grids of different sizes. Under the same example connection rule, the symbols still belong together, even though there is more space around them on one board. A real game may assign a different award or require a different minimum. Look up grid size, qualifying count and symbol value separately; none can safely be worked out from the others.

A wild needs a defined substitution role

Before counting a Wild, read what it can replace. Its appearance may suggest flexibility, but the rules decide which ordinary symbols it can stand for and which are excluded. Do not assume it joins every colour it touches, or counts as several categories at once. Until its substitution role is clear, a group that depends on that Wild remains unresolved.

For a hypothetical diagram, place a Wild between two blue groups and ask the actual rules whether it can connect those positions as blue. Do not decide the answer from the artwork alone. The same uncertainty applies if the Wild also touches another symbol category. A complete explanation would need the release’s treatment of competing or simultaneous uses; this general guide deliberately does not invent a universal priority rule.

Special symbols can have a role outside ordinary grouping

A scatter, collector or feature modifier can be visible near a cluster while following a separate trigger rule. Its presence does not automatically increase the ordinary-symbol group count. Identify the symbol category and the instruction it belongs to before deciding whether it is a member, a modifier or an unrelated feature input.

In a hypothetical sketch, outline the ordinary connected group and circle a nearby special symbol with a different marker. The two annotations make the questions separate: does the group qualify, and does the special instruction activate? If the rules connect them, describe that connection explicitly. If they do not establish a connection, do not add the special symbol just to reach a threshold or call its animation another ordinary cluster member.

Check for a qualifying award before applying a multiplier

A multiplier needs something eligible to multiply. Start by checking whether the connected group qualifies, then find the award or other value to which the factor applies. A large displayed multiplier cannot, by itself, establish an ordinary cluster win. Without the qualifying group and the instruction linking the factor to its award, part of the calculation is still missing.

An abstract arithmetic example can label the eligible award A and the factor M. The expression A times M requires both inputs and the instruction connecting them. A screenshot showing M without the qualifying group or A cannot supply the whole result. The example does not assign a formula to every cluster title. It shows why the reading order begins with recognition and then moves to the release-specific modifier and settlement rules.

Removal changes which positions need to be read next

When a game removes winning symbols and refills their spaces, the next arrangement is a new state for evaluation within the continuing sequence. A group recognised before removal is not carried into the next count simply because the animation continues. Trace the matching positions actually present after replacement.

For a hypothetical sequence, mark the first qualifying blue group, then remove those marked members under the example’s removal instruction. Draw the replacement symbols and trace their current connections afresh. A formerly isolated symbol may now join a group, while another may remain separate. The change explains why retaining only the earlier outline can misdescribe the later result. No prediction is made about the identities of the replacement symbols.

Count paid starts separately from refills

One paid start can lead to several board evaluations. Counting every refill animation as a purchased spin would overstate how many stakes were committed. At the other extreme, calling a whole session one continuing sequence can hide later paid starts. Use the game history and account record to identify when another stake was taken, then keep those events separate from the refills inside each sequence.

A hypothetical log can give one identifier to a paid start and letter its internal arrangements A, B and C. The letters describe successive states, not additional debits. A later paid start receives a new identifier. This simple distinction lets a reader explain a long cascade while keeping total stakes separate from the number of visual evaluations. It also prevents an impressive refill count from being presented as a count of independent paid wins.

Persistent cells require their own reset instruction

Some individual games attach marks or modifiers to positions. Whether those states last for a continuation, free-spin feature or another defined period is a release-specific question. A retained cell does not necessarily retain its ordinary symbol, and a replaced symbol does not necessarily erase every position-based value.

When making notes, name exactly what stays on the board and how long the rules say it lasts. Sugar Rush’s guide discusses position marks and multipliers; Chicken Drop focuses on a transformed region. Neither design should be assumed to apply to Aztec Clusters or cluster games generally. For any retained mark, check when it is carried forward and when that particular game clears or resets it.

Simultaneous-looking groups still need an evaluation rule

Two groups may be visible at the same time, but their visual coexistence does not fully specify how a game awards, removes or modifies them. A product can have instructions about separate components, special symbols and settlement order. Those details should be read rather than supplied by a generic cluster label.

For a hypothetical board review, label the groups A and B and record their distinct positions. Then consult the rules for how each qualifying component is treated. Do not merge them into one larger group if no permitted connection exists. Do not assume that one group’s modifier applies to the other. The labelled sketch preserves the evidence needed for a later calculation without inventing a universal multi-group formula.

A final return is different from a visible intermediate value

A cascade can display several component awards, factors and a running total. The final settled result may already include earlier components. Adding every intermediate total to the final credit would count the same value repeatedly. Identify whether a number labels a component, stored state, running total or completed settlement before placing it in a money record.

For a money record, group the internal awards beneath the paid event that started the sequence, then use the completed settlement as the credit entry. If the final screen is missing, leave the completed return unknown. A conspicuous multiplier or a large cluster cannot fill that gap. You can still explain the symbols you can see while being clear that the available record does not show the final financial result.

Knowing the connection rule does not predict the next grid

The rule tells how to recognise a displayed group. It does not reveal the next arrangement or the frequency of a particular shape. A five-symbol group in a diagram is a defined example, not evidence that such groups appear at a particular rate in a product. A large grid likewise does not supply a probability without the underlying model.

You can count a finished group correctly without learning anything about the next result. Earlier refills do not make another one due, and a nearly complete group does not entitle the board to its missing connection. A diagram can explain why a pattern qualifies; it cannot forecast what will appear. Use it to check the connection and threshold rules, then leave any claim about future frequency to evidence the illustration cannot provide.

Choose another article by the state that needs explanation

The named-game catalogue separates games that use different objects of progress. Chicken Drop changes a region of symbols, Sugar Rush tracks marked positions, and Hand of Anubis uses its own orb and feature counters. These examples can share continuing board activity while requiring different explanations of what persists and what triggers a change.

A focused enquiry can state the exact title, current stage, suspected group and missing input. It may ask whether diagonal contact is permitted, whether a Wild substitutes or whether a multiplier is already included in the displayed total. Each question points to a specific rule. Keeping those details together is more useful than treating all cluster titles as one paytable or using a common animation name to fill gaps in the evidence.

Check an illustration by changing one connection

Begin with the hypothetical L-shaped five-symbol group, then change only one bridging position to another symbol. Trace the remaining permitted paths again. If the alteration separates the shape, its earlier group count no longer describes the new board. This controlled change demonstrates why connection is an input alongside total symbol count. The example does not assume any particular symbol award.

Now restore the bridge and move an unrelated matching symbol elsewhere on the board. The connected group can remain unchanged even though the overall distribution looks different. Comparing these two changes helps distinguish a modification that affects membership from one that affects only an isolated position. A precise caption should explain that distinction rather than describe both pictures simply as more or fewer matching symbols.

Keep the provider example attached to its named release

Aztec Clusters supplies the concrete five-symbol, horizontal-and-vertical example used in this article. It does not establish all cluster mechanics, and the source does not make this publication a route to an operator account. Retaining the release name and dated source keeps the example’s scope clear whenever its threshold is mentioned.

If another game’s help specifies a different minimum or permitted connection, record that rule for that game. The general method still works: identify membership, count distinct positions, check qualification, follow modifiers and then read settlement. The method organises the enquiry without forcing every release into the same numerical specification. A difference in rules is a reason to update the example’s inputs, rather than a reason to override the loaded paytable.