explain_k2_algorithm
The K2 spaced-repetition engine, described. K2 stores no review dates: each item holds a probability p that halves on a correct answer and doubles on a wrong one, and items are drawn by Monte Carlo rejection sampling, so the pool self-organizes around current weaknesses and expands when it cools. Returns the update rule (including the deliberate hinted-answer exception), the selection and pool-expansion mechanics, the live tuning constants, and notes for porting it. Read this before simulate_k2_session.
Tool call template
This tool declares no required parameters. Add optional parameters from the input schema as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {},
"name": "explain_k2_algorithm"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||