Test one operation against every transition.
Review rotations, repeating states and simultaneous symbol shifts with worked examples. Six-item counts describe this original practice bank, not intelligence.
Six original items each contribute one correct answer. A count out of six describes this fixed bank, without an ability band, percentile or employer threshold. All six explanations and this full guide remain available at every count.
What stays constant?
A sequence question asks which operation can connect successive states. In these six items, the permitted operations are stated, so you compare a finite set rather than inventing an unlimited story. Track token order, row length and repeated positions separately. A row can change appearance while preserving the number of each token. Inversion changes bit counts, whereas rotation only changes positions. Those differences let you eliminate an operation before calculating every later step.
Work through a new rotation
Consider WXYZ → XYZW → YZWX. A left rotation removes the first token and appends that same token at the end, so the next row is ZWXY. Do not reverse the row while moving it. You can write position indices one to four and map the new order as two, three, four, one. Check both displayed arrows: a rule that matches the first example but contradicts the second cannot explain the supplied sequence.
A cycle is a state change, not a direction
Swapping two positions twice restores the original row. Rotating a four-token row left four times also restores it, although the intermediate states differ. Seeing the first row again does not mean the operation stopped or reversed. Continue the same specified step from that repeated state. When a string has duplicate symbols, two different operations can occasionally produce the same output; use all supplied transitions to distinguish them instead of relying on one convenient pair.
Read circular alphabets literally
For a fresh example, use the circular alphabet A B C D E and advance each token two positions. BD becomes DA: B moves to D, while D wraps past E to A. The alphabet and step belong to this example only. A normal alphabetical expectation or a six-symbol cycle from another question would give a different answer. Apply the mapping independently to every original position, including repeated tokens, before joining the output.
Separate simultaneous substitution from rewriting
A simultaneous substitution reads the original row once. If A becomes B and B becomes C, an original A produces B, not C. Reprocessing the newly written B would apply the rule twice. Keep an original and an output column on paper when this is easy to confuse. Also distinguish moving a token from replacing it: moving preserves its identity, while replacing may alter how often another token appears. The explanations identify which operation each item permits.
Record the first contradictory arrow
After an error, write the selected operation and find the earliest shown transition it fails to reproduce. This is more informative than simply circling the correct next row. Then make a fresh sequence using different tokens and test two plausible alternatives. Vary only one feature at a time, such as row length or rotation direction. You need not time this exercise: the published practice has no countdown and offers no speed-adjusted score or improvement guarantee.
Six answers are a local practice record
These items test applying and checking the explicitly listed symbolic operations in this edition. Their uniqueness is established within those listed candidates, not among every mathematical rule imaginable for a finite sequence. A count such as four out of six is not an IQ estimate, a fluid-intelligence band or a comparison with job applicants. Reading keys can improve repeat performance through memory. Use a new example and explain each intermediate state before treating a later attempt as fresh reasoning.