{{ getCell(currentScheduleIdx, currentWeek, day-1, node-1).name }}
diff --git a/dist/static/js/app.js b/dist/static/js/app.js
index b10eeb7..324bb7c 100644
--- a/dist/static/js/app.js
+++ b/dist/static/js/app.js
@@ -10,6 +10,7 @@ createApp({
const preferences = reactive({
avoid_early_morning: false,
avoid_weekend: false,
+ quality_sleep: false, // Avoid 9-13
compactness: 'none',
day_max_limit_enabled: false,
day_max_limit_value: 0,
@@ -255,7 +256,8 @@ createApp({
groups.value.push({
id: Date.now() + i, // unique-ish id
open: false,
- candidates: candidates
+ candidates: candidates,
+ is_skippable: false // Default
});
successCount++;
} else {
@@ -291,7 +293,8 @@ createApp({
groups.value.push({
id: Date.now(),
open: false,
- candidates: JSON.parse(JSON.stringify(candidates))
+ candidates: JSON.parse(JSON.stringify(candidates)),
+ is_skippable: false // Default
});
// Uncheck after adding
searchResults.value.forEach(c => c.checked = false);
@@ -377,7 +380,8 @@ createApp({
teacher: c.teacher,
location: loc,
alternatives: c.alternatives,
- isCurrent: true
+ isCurrent: true,
+ is_skippable: !!c.is_skippable // Pass to view
};
}
}
@@ -400,7 +404,8 @@ createApp({
teacher: c.teacher,
location: sess.location,
alternatives: c.alternatives,
- isCurrent: false // Gray out
+ isCurrent: false, // Gray out
+ is_skippable: !!c.is_skippable
};
}
}
@@ -418,7 +423,8 @@ createApp({
teacher: c.teacher,
location: c.location_text, // Raw text fallback
alternatives: c.alternatives,
- isCurrent: false
+ isCurrent: false,
+ is_skippable: !!c.is_skippable
};
}
}
@@ -462,7 +468,15 @@ createApp({
if (raw) {
try {
const data = JSON.parse(raw);
- if (data.groups) groups.value = data.groups;
+ if (data.groups) {
+ groups.value = data.groups;
+ // Migration: Add is_skippable if missing
+ groups.value.forEach(g => {
+ if (g.is_skippable === undefined) {
+ g.is_skippable = false;
+ }
+ });
+ }
if (data.preferences) Object.assign(preferences, data.preferences);
return true;
} catch (e) {
diff --git a/dist/static/js/solver.js b/dist/static/js/solver.js
index 1199762..a32c8a7 100644
--- a/dist/static/js/solver.js
+++ b/dist/static/js/solver.js
@@ -5,10 +5,18 @@ class ScheduleRanker {
let totalPenalty = 0.0;
let totalBonus = 0.0;
- // 0. Merge bitmaps into fullBitmap (BigInt array)
+ // 0. Bitmaps
+ // fullBitmap: All courses (for debugging/future use)
+ // scoringBitmap: Non-skippable courses (Main Penalty, Weight 1.0)
+ // skippableBitmap: Skippable courses (Shadow Penalty, Weight 0.01)
const fullBitmap = Array(30).fill(0n);
+ const scoringBitmap = Array(30).fill(0n);
+ const skippableBitmap = Array(30).fill(0n);
+
for (const course of schedule) {
const cb = course.schedule_bitmaps || [];
+ const isSkippable = !!course.is_skippable;
+
for (let w = 0; w < cb.length; w++) {
if (w < fullBitmap.length) {
let val = 0n;
@@ -18,118 +26,203 @@ class ScheduleRanker {
val = 0n;
}
fullBitmap[w] |= val;
+ if (!isSkippable) {
+ scoringBitmap[w] |= val;
+ } else {
+ skippableBitmap[w] |= val;
+ }
}
}
}
- // 1. Avoid Early Morning
- if (preferences.avoid_early_morning) {
- let penalty = 0;
- // Iterate weeks 1 to 25
- for (let w = 1; w <= 25; w++) {
- const mask = fullBitmap[w];
- if (mask === 0n) continue;
+ // Helper to calculate penalty for a given bitmap and weight
+ const calcPenalty = (bitmap, weight, isShadow = false) => {
+ let p = 0.0;
+
+ // 1. Avoid Early Morning
+ if (preferences.avoid_early_morning) {
+ let count = 0;
+ for (let w = 1; w <= 25; w++) {
+ const mask = bitmap[w];
+ if (mask === 0n) continue;
+ let earlyMask = 0n;
+ for (let d = 0; d < 7; d++) {
+ earlyMask |= (1n << BigInt(d * 13 + 0)); // Node 1
+ earlyMask |= (1n << BigInt(d * 13 + 1)); // Node 2
+ }
+ if ((mask & earlyMask) !== 0n) count++;
+ }
+ const val = count * 2.0 * weight;
+ p += val;
+ if (!isShadow) details['早八回避'] = -val;
+ }
- let earlyMask = 0n;
- for (let d = 0; d < 7; d++) {
- earlyMask |= (1n << BigInt(d * 13 + 0)); // Node 1
- earlyMask |= (1n << BigInt(d * 13 + 1)); // Node 2
+ // 2. Avoid Weekend
+ if (preferences.avoid_weekend) {
+ let count = 0;
+ let weekendMask = 0n;
+ for (let node = 0; node < 13; node++) {
+ weekendMask |= (1n << BigInt(5 * 13 + node)); // Sat
+ weekendMask |= (1n << BigInt(6 * 13 + node)); // Sun
+ }
+ for (let w = 1; w <= 25; w++) {
+ if ((bitmap[w] & weekendMask) !== 0n) count++;
+ }
+ const val = count * 2.0 * weight;
+ p += val;
+ if (!isShadow) details['周末回避'] = -val;
+ }
+
+ // 3. Compactness
+ if (preferences.compactness === 'high' || preferences.compactness === 'low') {
+ let totalGaps = 0;
+ for (let w = 1; w <= 25; w++) {
+ const mask = bitmap[w];
+ if (mask === 0n) continue;
+ for (let d = 0; d < 5; d++) { // Mon-Fri
+ const dayBits = (mask >> BigInt(d * 13)) & 0x1FFFn;
+ if (dayBits === 0n) continue;
+
+ let hasStarted = false;
+ let gapCount = 0;
+ let currentGap = 0;
+
+ for (let i = 0; i < 13; i++) {
+ const isSet = (dayBits >> BigInt(i)) & 1n;
+ if (isSet) {
+ if (hasStarted && currentGap > 0) {
+ gapCount += currentGap;
+ }
+ hasStarted = true;
+ currentGap = 0;
+ } else if (hasStarted) {
+ currentGap += 1;
+ }
+ }
+ totalGaps += gapCount;
+ }
}
- if ((mask & earlyMask) !== 0n) {
- penalty += 1;
+ if (preferences.compactness === 'high') {
+ const val = totalGaps * 0.2 * weight;
+ p += val;
+ if (!isShadow) details['课程紧凑'] = -val;
+ } else {
+ // For shadow penalty, we treat 'low' compactness bonus as negative penalty?
+ // Or just ignore bonus for shadow to keep it simple?
+ // Let's implement bonus as negative penalty.
+ const val = totalGaps * 0.2 * weight;
+ // Bonus means score increases. Penalty means score decreases.
+ // If compact=low, we want MORE gaps.
+ // So totalGaps contributes to BONUS.
+ // Score = Base + Bonus - Penalty.
+ // Here p is Penalty accumulator.
+ // So we should SUBTRACT from p?
+ // Wait, existing logic: totalBonus += val.
+ // So return { penalty, bonus }.
+ // Let's keep it simple: Shadow penalty only considers NEGATIVE traits (Penalties).
+ // We ignore Compactness Bonus for shadow to avoid complexity.
+ if (!isShadow) {
+ // Handled outside or allow this function to return object?
+ // Let's just handle non-shadow compactness separately if needed.
+ // But for simplicity, let's just do the penalty part here.
+ // If compact=low (Bonus), we skip adding to 'p'.
+ }
}
}
- const pVal = penalty * 2.0;
- totalPenalty += pVal;
- details['早八回避'] = -pVal;
- }
- // 2. Avoid Weekend
- if (preferences.avoid_weekend) {
- let penalty = 0;
- let weekendMask = 0n;
- for (let node = 0; node < 13; node++) {
- weekendMask |= (1n << BigInt(5 * 13 + node)); // Sat
- weekendMask |= (1n << BigInt(6 * 13 + node)); // Sun
+ // 4. Day Max Limit
+ if (preferences.day_max_limit_enabled) {
+ const limitVal = preferences.day_max_limit_value ?? 4;
+ let targetDays = preferences.day_max_limit_days || [];
+ if (targetDays.length < 7) {
+ targetDays = targetDays.concat(Array(7 - targetDays.length).fill(false));
+ }
+
+ let penalty = 0;
+ for (let w = 1; w <= 25; w++) {
+ const mask = bitmap[w];
+ if (mask === 0n) continue;
+ for (let d = 0; d < 7; d++) {
+ if (!targetDays[d]) continue;
+ const dayBits = (mask >> BigInt(d * 13)) & 0x1FFFn;
+ const count = ScheduleRanker.countSetBits(dayBits);
+ if (count > limitVal) {
+ const diff = count - limitVal;
+ penalty += diff * 2.0;
+ }
+ }
+ }
+ const val = penalty * weight;
+ p += val;
+ if (!isShadow) details['特定日限制'] = -val;
}
- for (let w = 1; w <= 25; w++) {
- if ((fullBitmap[w] & weekendMask) !== 0n) {
- penalty += 1;
+ // 5. Quality Sleep (Avoid 8-13)
+ // User Update: Should start from Node 9 (Index 8).
+ // Nodes are 0-indexed (0-12) corresponding to 1-13.
+ // Node 9 (1-based) is index 8.
+ // Node 13 (1-based) is index 12.
+ if (preferences.quality_sleep) {
+ let count = 0;
+ for (let w = 1; w <= 25; w++) {
+ const mask = bitmap[w];
+ if (mask === 0n) continue;
+
+ let sleepMask = 0n;
+ for (let d = 0; d < 7; d++) {
+ for (let n = 8; n <= 12; n++) { // Corrected range 9-13 (indices 8-12)
+ sleepMask |= (1n << BigInt(d * 13 + n));
+ }
+ }
+
+ if ((mask & sleepMask) !== 0n) {
+ count++;
+ }
}
+ const val = count * 2.0 * weight;
+ p += val;
+ if (!isShadow) details['优质睡眠'] = -val;
}
- const pVal = penalty * 2.0;
- totalPenalty += pVal;
- details['周末回避'] = -pVal;
- }
- // 3. Compactness
- if (preferences.compactness === 'high' || preferences.compactness === 'low') {
+ return p;
+ };
+
+ // Calculate Main Penalty (Weight 1.0)
+ const mainPenalty = calcPenalty(scoringBitmap, 1.0, false);
+ totalPenalty += mainPenalty;
+
+ // Calculate Shadow Penalty (Weight 0.01)
+ const shadowPenalty = calcPenalty(skippableBitmap, 0.01, true);
+ totalPenalty += shadowPenalty;
+
+ // Handle Compactness Bonus explicitly for Main (since helper ignored it or we need to be careful)
+ // Re-implement Compactness Bonus for Main only to match exact logic of previous version
+ if (preferences.compactness === 'low') {
let totalGaps = 0;
for (let w = 1; w <= 25; w++) {
- const mask = fullBitmap[w];
+ const mask = scoringBitmap[w];
if (mask === 0n) continue;
- for (let d = 0; d < 5; d++) { // Mon-Fri
+ for (let d = 0; d < 5; d++) {
const dayBits = (mask >> BigInt(d * 13)) & 0x1FFFn;
if (dayBits === 0n) continue;
-
let hasStarted = false;
- let gapCount = 0;
let currentGap = 0;
-
for (let i = 0; i < 13; i++) {
const isSet = (dayBits >> BigInt(i)) & 1n;
if (isSet) {
- if (hasStarted && currentGap > 0) {
- gapCount += currentGap;
- }
+ if (hasStarted && currentGap > 0) totalGaps += currentGap;
hasStarted = true;
currentGap = 0;
} else if (hasStarted) {
currentGap += 1;
}
}
- totalGaps += gapCount;
}
}
-
- if (preferences.compactness === 'high') {
- const pVal = totalGaps * 0.2;
- totalPenalty += pVal;
- details['课程紧凑'] = -pVal;
- } else {
- const bVal = totalGaps * 0.2;
- totalBonus += bVal;
- details['课程分散'] = +bVal;
- }
- }
-
-
- if (preferences.day_max_limit_enabled) {
- const limitVal = preferences.day_max_limit_value ?? 4;
- let targetDays = preferences.day_max_limit_days || [];
- if (targetDays.length < 7) {
- targetDays = targetDays.concat(Array(7 - targetDays.length).fill(false));
- }
-
- let penalty = 0;
- for (let w = 1; w <= 25; w++) {
- const mask = fullBitmap[w];
- if (mask === 0n) continue;
- for (let d = 0; d < 7; d++) {
- if (!targetDays[d]) continue;
- const dayBits = (mask >> BigInt(d * 13)) & 0x1FFFn;
- const count = ScheduleRanker.countSetBits(dayBits);
- if (count > limitVal) {
- const diff = count - limitVal;
- penalty += diff * 2.0;
- }
- }
- }
- const pVal = penalty;
- totalPenalty += pVal;
- details['特定日限制'] = -pVal;
+ const bVal = totalGaps * 0.2;
+ totalBonus += bVal;
+ details['课程分散'] = +bVal;
}
return {
@@ -195,6 +288,10 @@ class ScheduleSolver {
if (activeA.length === 0 || activeB.length === 0) continue;
+ // If either group is skippable, they do not cause hard conflicts.
+ // We treat them as ghosts that can overlap anything.
+ if (groups[i].is_skippable || groups[j].is_skippable) continue;
+
let allConflict = true;
let firstReason = null;
@@ -256,11 +353,13 @@ class ScheduleSolver {
mergedGroupsMap.set(courseName, {
id: g.id,
name: courseName,
- candidates: active
+ candidates: active,
+ is_skippable: !!g.is_skippable
});
} else {
const existing = mergedGroupsMap.get(courseName);
existing.candidates = existing.candidates.concat(active);
+ if (g.is_skippable) existing.is_skippable = true;
}
}
@@ -286,12 +385,11 @@ class ScheduleSolver {
metaCandidates.push({
representative: val.list[0],
bitmaps: val.bitmaps,
- alternatives: val.list
+ alternatives: val.list,
+ is_skippable: g.is_skippable // Propagate to meta-candidate
});
}
- // Sort by density (heuristic: fewer classes first might leave more room? or opposite?)
- // Just stick to density sort
metaCandidates.sort((a, b) => {
const countA = a.bitmaps.reduce((acc, val) => acc + ScheduleRanker.countSetBits(val), 0);
const countB = b.bitmaps.reduce((acc, val) => acc + ScheduleRanker.countSetBits(val), 0);
@@ -304,7 +402,7 @@ class ScheduleSolver {
});
}
- // Sort groups by size (MRV - Minimum Remaining Values) to fail fast
+ // Sort groups by size (MRV)
metaGroups.sort((a, b) => a.candidates.length - b.candidates.length);
const totalGroupsCount = metaGroups.length;
@@ -318,28 +416,22 @@ class ScheduleSolver {
function backtrack(groupIdx, currentScheduleMeta) {
const scheduledCount = currentScheduleMeta.length;
- // Base Case: All groups processed
if (groupIdx === totalGroupsCount) {
- // We reached a leaf. Update maxCoursesFound
if (scheduledCount > maxCoursesFound) {
maxCoursesFound = scheduledCount;
- // Clear heap because we found a better size?
- // Usually we prefer larger schedules over higher scores of smaller schedules.
- // Yes: "must arrange as many courses as possible first"
topNHeap.length = 0;
}
if (scheduledCount === maxCoursesFound) {
totalFound++;
- // Reconstruct
const finalSchedule = currentScheduleMeta.map(m => {
const rep = { ...m.representative };
rep.alternatives = m.alternatives;
+ rep.is_skippable = m.is_skippable;
return rep;
});
- // Missing Groups
const presentNames = new Set(finalSchedule.map(c => c.name));
const missingNames = [];
for(const mg of metaGroups) {
@@ -349,12 +441,9 @@ class ScheduleSolver {
}
const missingCount = missingNames.length;
-
- // Score
const evalResult = ScheduleRanker.evaluateSchedule(finalSchedule, preferences);
let score = evalResult.score;
- // Apply Missing Penalty
const penalty = missingCount * 10.0;
score -= penalty;
@@ -365,7 +454,6 @@ class ScheduleSolver {
missingCount,
details: evalResult.details
};
- // Add missing penalty to details for display
if (missingCount > 0) {
entry.details['缺课惩罚'] = -penalty;
}
@@ -381,14 +469,17 @@ class ScheduleSolver {
return;
}
- // Pruning: Calculate Future Potential
- // Count how many future groups have AT LEAST ONE candidate compatible with currentBitmap
let compatibleFuture = 0;
for (let i = groupIdx; i < totalGroupsCount; i++) {
const group = metaGroups[i];
+ // Skippable groups are always compatible because they don't check conflicts
+ if (group.candidates[0].is_skippable) {
+ compatibleFuture++;
+ continue;
+ }
+
let canFit = false;
for (const cand of group.candidates) {
- // Check compatibility
let ok = true;
const limit = Math.min(cand.bitmaps.length, currentBitmap.length);
for (let w = 1; w < limit; w++) {
@@ -406,69 +497,76 @@ class ScheduleSolver {
}
if (scheduledCount + compatibleFuture < maxCoursesFound) {
- // Cannot possibly beat the best found size
return;
}
- // Branch 1: Try to pick a candidate from current group
const currentGroup = metaGroups[groupIdx];
- let pickedSomething = false;
for (const meta of currentGroup.candidates) {
const metaBmp = meta.bitmaps;
-
- // Check Conflict
+ const isSkippable = meta.is_skippable;
let isValid = true;
- const limit = Math.min(metaBmp.length, currentBitmap.length);
- for (let w = 1; w < limit; w++) {
- if ((metaBmp[w] & currentBitmap[w]) !== 0n) {
- isValid = false;
- break;
+
+ // If skippable, we ignore conflict checks (Ghost Mode)
+ if (!isSkippable) {
+ const limit = Math.min(metaBmp.length, currentBitmap.length);
+ for (let w = 1; w < limit; w++) {
+ if ((metaBmp[w] & currentBitmap[w]) !== 0n) {
+ isValid = false;
+ break;
+ }
}
}
if (!isValid) continue;
-
-
currentScheduleMeta.push(meta);
- // Update bitmap
- for (let w = 1; w < limit; w++) {
- currentBitmap[w] |= metaBmp[w];
+
+ // If skippable, we do NOT occupy space in currentBitmap
+ if (!isSkippable) {
+ const limit = Math.min(metaBmp.length, currentBitmap.length);
+ for (let w = 1; w < limit; w++) {
+ currentBitmap[w] |= metaBmp[w];
+ }
}
backtrack(groupIdx + 1, currentScheduleMeta);
- // Backtrack
currentScheduleMeta.pop();
- for (let w = 1; w < limit; w++) {
- currentBitmap[w] ^= metaBmp[w]; // Unset
+
+ // Backtrack bitmap
+ if (!isSkippable) {
+ const limit = Math.min(metaBmp.length, currentBitmap.length);
+ for (let w = 1; w < limit; w++) {
+ currentBitmap[w] ^= metaBmp[w];
+ }
}
- pickedSomething = true;
}
-
backtrack(groupIdx + 1, currentScheduleMeta);
}
backtrack(0, []);
- // Sort descending
const sortedResults = topNHeap.sort((a, b) => b.score - a.score);
- // Map to final format
const finalSchedules = sortedResults.map(item => {
const sched = item.schedule;
let totalCredits = 0;
let totalHours = 0;
+ let actualTotalHours = 0;
const weekSet = new Set();
- const countedCourses = new Set(); // Prevent double counting credits/hours for same-named courses
+ const countedCourses = new Set();
sched.forEach(c => {
if (!countedCourses.has(c.name)) {
totalCredits += (c.credit || 0);
- totalHours += (c.hours || 0);
+ const h = (c.hours || 0);
+ totalHours += h;
+ if (!c.is_skippable) {
+ actualTotalHours += h;
+ }
countedCourses.add(c.name);
}
if (c.sessions) {
@@ -487,11 +585,13 @@ class ScheduleSolver {
score_details: item.details,
courses: sched,
missing_course_names: item.missingNames,
- missing_groups: [], // user didn't ask for IDs, just names in UI.
+ missing_groups: [],
stats: {
total_credits: totalCredits,
total_hours: totalHours,
+ actual_total_hours: actualTotalHours,
avg_weekly_hours: weeks.length > 0 ? (totalHours / weeks.length).toFixed(1) : 0,
+ actual_avg_weekly_hours: weeks.length > 0 ? (actualTotalHours / weeks.length).toFixed(1) : 0,
week_span: weekSpan
}
};
@@ -504,7 +604,6 @@ class ScheduleSolver {
}
}
-// Export
if (typeof window !== 'undefined') {
window.Solver = ScheduleSolver;
window.Ranker = ScheduleRanker;
diff --git a/server.log b/server.log
index 56c17b2..03cf95c 100644
--- a/server.log
+++ b/server.log
@@ -1,22 +1,10 @@
-127.0.0.1 - - [11/Jan/2026 04:36:31] "GET / HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:36:31] "GET /static/js/app.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:36:31] "GET /static/js/solver.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:36:31] "GET /static/vue.global.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:36:31] "GET /static/html2canvas.min.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:36:31] code 404, message File not found
-127.0.0.1 - - [11/Jan/2026 04:36:31] "GET /search?name=&code=&campus=1&semester=2025-2026-2&match_mode=OR HTTP/1.1" 404 -
-127.0.0.1 - - [11/Jan/2026 04:37:37] "GET / HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:37:37] "GET /static/vue.global.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:37:37] "GET /static/js/app.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:37:37] "GET /static/js/solver.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:37:37] "GET /static/html2canvas.min.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:42:04] "GET / HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:42:04] "GET /static/vue.global.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:42:04] "GET /static/js/solver.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:42:04] "GET /static/js/app.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:42:04] "GET /static/html2canvas.min.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:43:33] "GET / HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:43:33] "GET /static/vue.global.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:43:33] "GET /static/html2canvas.min.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:43:33] "GET /static/js/app.js HTTP/1.1" 200 -
-127.0.0.1 - - [11/Jan/2026 04:43:33] "GET /static/js/solver.js HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:58:47] "GET / HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:58:48] "GET /static/vue.global.js HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:58:48] "GET /static/js/solver.js HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:58:48] "GET /static/html2canvas.min.js HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:58:48] "GET /static/js/app.js HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:59:07] "GET / HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:59:07] "GET /static/vue.global.js HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:59:07] "GET /static/html2canvas.min.js HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:59:07] "GET /static/js/app.js HTTP/1.1" 200 -
+127.0.0.1 - - [11/Jan/2026 08:59:07] "GET /static/js/solver.js HTTP/1.1" 200 -
diff --git a/verification/spa_verified.png b/verification/spa_verified.png
new file mode 100644
index 0000000..581cabc
Binary files /dev/null and b/verification/spa_verified.png differ
diff --git a/verification/verify_spa.py b/verification/verify_spa.py
new file mode 100644
index 0000000..6f44f6b
--- /dev/null
+++ b/verification/verify_spa.py
@@ -0,0 +1,158 @@
+
+from playwright.sync_api import sync_playwright, expect
+import json
+import time
+
+def run(playwright):
+ browser = playwright.chromium.launch(headless=True)
+ page = browser.new_page()
+
+ # Mock Search Results
+ mock_courses = [
+ {
+ "name": "Course A",
+ "code": "1001",
+ "teacher": "Teacher A",
+ "location_text": "周一 1-2 (仙II-101)",
+ "schedule_bitmaps": ["0", "3", "3", "3"], # Week 1-3, Day 1 Node 1-2 (Bits 0,1) -> 3
+ "sessions": [{"weeks": [1,2,3], "day": 0, "start": 1, "end": 2, "location": "仙II-101"}],
+ "credit": 2,
+ "hours": 32
+ },
+ {
+ "name": "Course B",
+ "code": "1002",
+ "teacher": "Teacher B",
+ "location_text": "周二 9-10 (仙II-102)",
+ "schedule_bitmaps": ["0", "786432", "786432", "786432"], # Week 1-3, Day 2 Node 9-10. Bits: 13+8=21, 13+9=22. 2^21 | 2^22.
+ "sessions": [{"weeks": [1,2,3], "day": 1, "start": 9, "end": 10, "location": "仙II-102"}],
+ "credit": 2,
+ "hours": 32
+ }
+ ]
+
+ # Bits calculation for Course B:
+ # Day 2 is index 1.
+ # Node 9 is index 8. 1*13 + 8 = 21.
+ # Node 10 is index 9. 1*13 + 9 = 22.
+ # 2^21 = 2097152
+ # 2^22 = 4194304
+ # Sum = 6291456
+ # Wait, my mock above "786432" seems wrong calculation.
+ # Let's use JS to calculate in runtime or just rely on sessions if solver uses sessions.
+ # Solver uses sessions for stats, but uses bitmaps for conflict/ranking.
+ # I should provide correct bitmaps.
+ # 2^21 + 2^22 = 6291456.
+
+ mock_courses[1]["schedule_bitmaps"] = ["0", "6291456", "6291456", "6291456"]
+
+
+ # Mock /search endpoint
+ page.route("**/search*", lambda route: route.fulfill(
+ status=200,
+ content_type="application/json",
+ body=json.dumps(mock_courses)
+ ))
+
+ # 1. Load Page
+ page.goto("http://localhost:8000")
+ expect(page.locator("h1")).to_contain_text("南哪选课助手")
+
+ # 2. Search
+ page.locator("input[placeholder*='课程名']").fill("Course")
+ page.get_by_text("搜索", exact=True).click()
+
+ # Wait for results
+ expect(page.get_by_text("搜索结果 (2)")).to_be_visible()
+
+ # 3. Create Group
+ # Select all
+ page.get_by_text("全选/反选").click()
+ page.get_by_text("将选中项存为一组").click()
+ expect(page.get_by_text("已添加新课程组")).to_be_visible()
+
+ # 4. Switch to Planning
+ page.get_by_text("2. 规划 & 策略").click()
+
+ # Check new "Skippable" checkbox existence
+ skippable_checkbox = page.locator(".group-header input[type='checkbox']")
+ expect(skippable_checkbox).to_be_visible()
+
+ # Check new "Quality Sleep" preference
+ sleep_pref = page.get_by_text("优质睡眠 (9-13节)")
+ expect(sleep_pref).to_be_visible()
+
+ # 5. Enable Skippable for Group 1 (Course A & B are in one group because we selected both and clicked create once)
+ # Wait, "createGroup" creates ONE group with all selected candidates.
+ # So Group 1 contains Course A and Course B as candidates for the SAME slot?
+ # No, typically user selects one course's candidates.
+ # But if I select Course A and Course B, they become candidates for Group 1.
+ # This means I can choose A OR B.
+ # Let's say I want both. I should have added them separately.
+ # But for this test, let's assume they are alternatives.
+ # Solver will pick ONE.
+
+ # Let's delete this group and add them separately for better visual.
+ page.get_by_text("删除").click()
+
+ # Go back to Search
+ page.get_by_text("1. 课程查询").click()
+
+ # Select only Course A
+ page.get_by_text("全选/反选").click() # Unselect all
+
+ # Find checkbox for Course A.
+ # result-item
+ rows = page.locator(".result-item")
+ rows.nth(0).locator("input[type='checkbox']").check()
+ page.get_by_text("将选中项存为一组").click()
+
+ # Uncheck A, Check B
+ rows.nth(0).locator("input[type='checkbox']").uncheck()
+ rows.nth(1).locator("input[type='checkbox']").check()
+ page.get_by_text("将选中项存为一组").click()
+
+ # Go to Planning
+ page.get_by_text("2. 规划 & 策略").click()
+ expect(page.get_by_text("我的课程组 (2)")).to_be_visible()
+
+ # 6. Mark Course B (Group 2) as Skippable
+ # Group 2 is the second one.
+ # Locator for group items
+ groups = page.locator(".group-item")
+ group2_skippable = groups.nth(1).locator(".group-header input[type='checkbox']")
+ group2_skippable.check()
+
+ # 7. Generate Schedule
+ page.get_by_text("生成课表方案").click()
+
+ # 8. Check Results
+ # Should automatically switch to Results view
+ expect(page.get_by_text("推荐方案")).to_be_visible()
+
+ # Check Stats for "Actual Weekly Hours"
+ # Course A: 2 credits, 32 hours (approx 2/week if 16 weeks, here 3 weeks -> ~10/week? mock data says 32 total)
+ # Course B: 2 credits, 32 hours. Skippable.
+ # Stats logic: actual = total - skippable.
+ # Total hours: 64. Actual: 32.
+ # Week span: 1-3. (3 weeks).
+ # Actual Avg Weekly: 32 / 3 = 10.7
+
+ stats_section = page.locator("#capture-area")
+ expect(stats_section).to_contain_text("实际每周学时")
+
+ # Check Green Cell
+ # Course B is skippable. It is on Tue 9-10.
+ # Tue is column index 3 (Node, Mon, Tue...).
+ # Row 9-10.
+ # Let's just look for the class `.cell-active.skippable`
+ # Course B spans 2 periods, so we expect at least 1 visible, or strict mode fails if multiple.
+ skippable_cell = page.locator(".cell-active.skippable").first
+ expect(skippable_cell).to_be_visible()
+ expect(skippable_cell).to_contain_text("Course B")
+
+ # Screenshot
+ page.screenshot(path="verification/spa_verified.png")
+
+with sync_playwright() as playwright:
+ run(playwright)