diff --git a/custom_components/taskmate/manifest.json b/custom_components/taskmate/manifest.json
index 60eefe49..e85d59f5 100644
--- a/custom_components/taskmate/manifest.json
+++ b/custom_components/taskmate/manifest.json
@@ -17,5 +17,5 @@
   "iot_class": "calculated",
   "issue_tracker": "https://github.com/tempus2016/taskmate/issues",
   "requirements": [],
-  "version": "7.6.0"
+  "version": "7.7.0"
 }
diff --git a/wiki/Automations.md b/wiki/Automations.md
index dba31b09..9e3c39a0 100644
--- a/wiki/Automations.md
+++ b/wiki/Automations.md
@@ -39,7 +39,7 @@ TaskMate listens for `state_changed` events on all entities configured as a chil
 
 | Mode | Algorithm |
 |------|-----------|
-| `alternating` | Round-robin: the number of times the chore has come up since the anchor date, `mod pool_size`, picks the child index. Only the chore's due days count (v7.6.1+; before that it counted calendar days, so a chore that wasn't daily could get stuck on one child) |
+| `alternating` | Round-robin: the number of times the chore has come up since the anchor date, `mod pool_size`, picks the child index. Only the chore's due days count (v7.7.0+; before that it counted calendar days, so a chore that wasn't daily could get stuck on one child) |
 | `random` | Deterministic daily pick using `SHA256(chore_id + date)` — stable within a day, changes at midnight |
 | `balanced` | Groups all balanced-mode chores sharing the same child pool, sorts by ID, and distributes evenly via round-robin so no child gets more than one extra chore |
 
diff --git a/wiki/Chores.md b/wiki/Chores.md
index fea466a2..a0e2ec63 100644
--- a/wiki/Chores.md
+++ b/wiki/Chores.md
@@ -302,7 +302,7 @@ Controls how a chore is distributed when assigned to multiple children.
 | `first_come` | Competitive — the chore is shown to the whole pool and the first child to complete it wins; it then locks for everyone else for the day. With a daily limit above 1 the pool shares the limit: it stays open until it has been done that many times in total, by anyone (v7.6.0+). See [First Come First Served](Chore-Scheduling.md#first-come-first-served). |
 | `unassigned` | Not auto-assigned to any child. The chore is hidden from child cards — a parent must complete it on behalf of a child via a service call or the admin panel. Use for parent-only or optional tasks. |
 
-For `alternating` and `random` modes, an **Assignment Rotation Anchor** date is used as the starting reference point for the rotation/randomisation algorithm. An alternating chore gets today as its anchor when it is created, or when an existing chore is switched to alternating, so the first child in the list starts today (v7.6.1+). Alternating chores saved before v7.6.1 without an anchor count from a fixed date instead; they used to give the chore to the first child every day.
+For `alternating` and `random` modes, an **Assignment Rotation Anchor** date is used as the starting reference point for the rotation/randomisation algorithm. An alternating chore gets today as its anchor when it is created, or when an existing chore is switched to alternating, so the first child in the list starts today (v7.7.0+). Alternating chores saved before v7.7.0 without an anchor count from a fixed date instead; they used to give the chore to the first child every day.
 
 > **Note:** When a child's availability entity is unavailable and **Require Availability** is on, they are skipped in the rotation.