How does the rotation algorithm prevent consecutive tasks?

The system uses a daily offset that increments each day, shifting the task index for every participant to ensure no one repeats a chore two days in a row.

Can I verify if my generated schedule is valid?

Yes, you can use the `validate_rotation_integrity` tool to inspect your schedule for any consecutive assignment violations.

How do I check if tasks are distributed equally?

Use the `calculate_task_frequency` tool to generate a frequency map of all tasks in your schedule, allowing you to measure distribution equality.

Fair Chore Rotation Algorithm MCP Connector for Claude

A+

A deterministic scheduling system to rotate tasks among participants without consecutive repeats.

3 tools Official Updated Oct 1, 2026 Official Vinkius Partner

More Details Connect to Claude

The Fair Chore Rotation Algorithm ensures a perfectly balanced distribution of responsibilities. By using cyclic rotation and daily offsets, the system guarantees that no participant is assigned the same task on consecutive days. Use generate_rotation_grid to create schedules, validate_rotation_integrity to check for violations, and calculate_task_frequency to measure assignment equality.

rotationschedulingfairnessalgorithmtasks

Connect to Claude

Subscribe on Vinkius, then add this connector to Claude.ai or Claude Code.

① Claude.ai (web app)

Go to Settings → Connectors → Add custom connector
Paste the MCP endpoint URL below

https://edge.vinkius.com/vk_preview_GF7FSilbgP1LejdWxI9zWflHpBBUQUUBGk3uXANy/mcp

② Claude Code (terminal)

claude mcp add --transport http fair-chore-rotation-algorithm https://edge.vinkius.com/vk_preview_GF7FSilbgP1LejdWxI9zWflHpBBUQUUBGk3uXANy/mcp

③ Claude Desktop

Add to claude_desktop_config.json:

{
  "mcpServers": {
    "fair-chore-rotation-algorithm": {
      "url": "https://edge.vinkius.com/vk_preview_GF7FSilbgP1LejdWxI9zWflHpBBUQUUBGk3uXANy/mcp"
    }
  }
}

Get full access on Vinkius

The preview token above works for testing. Powered by Vinkius.