calendar = { const state = { level: 1, // Array<{ entry, timestamp }> schedule: [], // Map stages: new Map(), // Map mistakes: new Map(), burned: 0, // Reset at the start of every day lessonCap: 0, reviewCap: 0, }; function update() { for (const [level, entries] of ALL_BY_LEVEL.entries()) { if (level > state.level) { break; } for (const entry of entries) { if (state.stages.has(entry)) { continue; } if (entry.level > state.level) { continue; } const isReady = entry.dependencies .map(depId => ALL_BY_ID.get(depId)) .map(dep => state.stages.get(dep) ?? 0) .every(stage => stage >= GURU_STAGE); if (!isReady) { continue; } // 0 - not learned yet state.stages.set(entry, 0); state.mistakes.set(entry, 0); } } } const DAY = 24; let ticks = 0; const calendar = []; for ( let now = 0; now < DAY * SIMULATION_DAYS && state.burned < ALL.length; now += DAY / CONFIG.RUNS_PER_DAY, ticks++ ) { // Add new lessons update(); const shouldReview = (ticks % CONFIG.REVIEW_EVERY) === 0; const shouldLesson = (ticks % CONFIG.LESSON_EVERY) === 0; if ((ticks % CONFIG.RUNS_PER_DAY) === 0) { state.lessonCap = MAX_LESSONS_PER_DAY; state.reviewCap = MAX_REVIEWS_PER_DAY; } const lessons = Array.from(state.stages.entries()) .filter(([ _, stage ]) => stage === 0) .map(([ entry ]) => entry) .sort((a, b) => { // Order by level if (a.level !== b.level) { return a.level - b.level; } // Then by order return a.order - b.order; }); // Note that state.schedule is always sorted (we keep track of it below) const reviews = []; while ( shouldReview && state.schedule.length && state.schedule[0].timestamp <= now && reviews.length < state.reviewCap ) { reviews.push(state.schedule.shift().entry); } state.reviewCap -= reviews.length; d3.shuffle(reviews); let countByStage = new Map(); let apprenticeCount = 0; for (const stage of state.stages.values()) { if (stage === 0) { continue; } if (stage < GURU_STAGE) { apprenticeCount++; } const stageName = STAGE_NAMES[stage]; countByStage.set(stageName, (countByStage.get(stageName) ?? 0) + 1); } const toLearn = lessons.slice( 0, shouldLesson ? Math.min( state.lessonCap, Math.max(0, MAX_APPRENTICE - apprenticeCount) ) : 0 ); state.lessonCap -= toLearn.length; let updatedSchedule = false; for (const entry of toLearn) { const newStage = 1; state.stages.set(entry, newStage); const delays = getSRSDelaysByLevel(entry.level); state.schedule.push({ entry, timestamp: now + delays[newStage], }); updatedSchedule = true; } for (const entry of reviews) { let newStage = state.stages.get(entry); const isSuccess = Math.random() >= MISTAKE_RATE / 100; if (isSuccess) { newStage += 1; } else { const mistakes = state.mistakes.get(entry) + 1; state.mistakes.set(entry, mistakes); newStage -= Math.ceil(mistakes / 2) * getSRSPenaltyFactor(newStage); newStage = Math.max(1, newStage); } state.stages.set(entry, newStage); const delays = getSRSDelaysByLevel(entry.level); if (newStage >= delays.length) { state.burned++; continue; } state.schedule.push({ entry, timestamp: now + delays[newStage], }); updatedSchedule = true; } if (updatedSchedule) { state.schedule.sort((a, b) => a.timestamp - b.timestamp); } let kanjiInGuru = 0; for (const [ { level, type }, stage ] of state.stages.entries()) { if (stage < GURU_STAGE) { continue; } if (type !== 'kanji') { continue; } if (level === state.level) { kanjiInGuru++; } } if ( state.level < LEVELUP_REQUIREMENT.length && kanjiInGuru >= LEVELUP_REQUIREMENT[state.level] ) { state.level++; } const Level = state.level; const Lessons = toLearn.length; const Reviews = reviews.length; const Burned = state.burned / ALL.length * 100; if (ticks % CONFIG.RUNS_PER_DAY === 0) { calendar.push({ Days: now / DAY, Level, Lessons, Reviews, 'Burned %': Burned, 'Apprentice Count': apprenticeCount, 'By Stage': countByStage, }); } else { const last = calendar[calendar.length - 1]; last.Level = Level; last.Lessons += Lessons; last.Reviews += Reviews; last['Burned %'] = Burned; last['Apprentice Count'] = apprenticeCount; last['By Stage'] = countByStage; } } return calendar; }