Planner123 1.0: Your Week, Optimized

We’re releasing Planner123 1.0, a desktop app that schedules your work week using constraint optimization. You give it tasks with durations, priorities, and dependencies. You connect Google Calendar so your existing meetings stay pinned. The solver finds the best arrangement of everything else – or tells you it can’t.

No AI hallucinations. No guessing. Math.

What It Does

Planner123 models your work week as a constraint satisfaction problem. It takes your tasks and finds the best way to arrange them across your schedule – or tells you it can’t.

Time is divided into 15-minute slots:

• Working hours: 9:00 – 18:00
• Lunch break: 13:00 – 14:00 (excluded)
• Weekends: excluded
• Slots per day: 32 (16 morning + 16 afternoon)

Tasks are organized into projects and linked by DAG dependencies – explicit predecessor/successor edges with built-in cycle detection. High-priority tasks get morning preference. Everything respects your existing calendar.

8 Constraints

All constraints are individually toggleable at runtime. The solver reports violations in plain English – not codes, not stack traces, not silence.

Your Calendar Is Confidential

Think about what’s in your calendar. Every meeting, every client name, every project codename, every doctor’s appointment, every 1:1 with the person you’re about to promote or let go. Your calendar is a complete map of your priorities, your relationships, and your time.

Every cloud-based scheduling tool asks you to hand that over. They sync it to their servers. They process it through their APIs. They store it in their databases. Some of them feed it to AI models. Most of them don’t tell you exactly what happens to it. All of them require you to trust a third party with the most detailed record of your professional life.

Planner123 runs on your machine. Your data never leaves your laptop. The solver runs locally in native Rust – not in a browser tab making API calls, not in a sandboxed VM phoning home, not “on-device” with an asterisk. Locally. The binary doesn’t even make network requests unless you explicitly connect Google Calendar, and even then the OAuth flow talks directly to Google – we never see your tokens or your events.

Faster, too. 350,000+ moves per second, zero network latency, zero waiting for a server to spin up.

The Philosophy

The engine underneath Planner123 – SolverForge – is open source. Truly open source. You can read every line, fork it, build on it. That part is free and always will be.

Planner123 itself is closed source. It’s a commercial product. We can’t give it away – rent isn’t a soft constraint.

So we did the next best thing: shareware.

Take the binary. Use it. It’s yours – not “yours until you stop paying,” not “yours on up to 3 devices,” not “yours according to section 14.2(b).” Yours. If it makes your week better, come back and pay what it’s worth. If it makes your business better, buy the source and build on it.

No subscriptions. No seat licenses. No enterprise negotiations. No tricks, no gates, no guilt. Just the oldest deal in software: a developer and a user.

Pricing

The most expensive tier is called “Free” on the landing page. That’s not a typo. It’s the only tier where the software is truly free – you get the full repo, you own the code, you can scale it, ship it in your own product. Freedom has a price. We put ours on the label.

How It Works

You add your tasks. You set durations, priorities, and dependencies. You connect Google Calendar. You hit solve.

Planner123 runs a constraint solver powered by SolverForge 0.5.2 that evaluates hundreds of thousands of possible arrangements per second, searching for the one that satisfies all your hard constraints while optimizing the soft ones. The solver runs in the background – you watch your schedule assemble itself in real time.

Performance:

Three Views

Planner123 provides three synchronized views of your schedule:

Plan – An outliner-style editor for managing tasks. Inline editing, drag-and-drop reorder, dependency indicators, and a right-click context menu for pinning, priority changes, and bulk actions. This is where you define the problem.

Gantt – A Frappe Gantt chart showing your solved schedule on a timeline. Dependency arrows render across projects. Google Calendar events appear as pinned blocks the solver works around.

Calendar – A FullCalendar month view. Drag a task to a new slot and the solver reflows everything else. Your score updates in real time.

All three views update live as the solver runs. The score panel shows hard and soft constraint satisfaction, and any violations are explained in human-readable detail.

Architecture

Planner123 is a Tauri v2 application. The backend is Rust. The frontend is vanilla JavaScript served through the system’s native WebView – no Electron, no bundled Chromium, no 200 MB of overhead.

The constraint solver runs natively via SolverForge 0.5.2. The UI is built with Shoelace web components, Frappe Gantt, FullCalendar, and vis-timeline – all vendored offline. There are no CDN requests, no build step, and no Node.js dependency. The app runs fully airgapped after installation.

Supported platforms:

• Linux: DEB, RPM, AppImage
• Windows: MSI, NSIS installer
• macOS: DMG (experimental)

What’s Next

Planner123 1.0 ships the core scheduling engine. The roadmap includes:

• Unlimited scheduling horizon – currently limited to 7 days in the shareware tier
• Data source integrations – import tasks from Markdown, CSV, and other formats
• AI agent integration – call Planner123 from your AI agent or automation pipeline
• REST API – expose the solver as a local HTTP service for programmatic access
• Web application – a Rails + Rust version for teams
• Skills and fairness constraints – for team scheduling scenarios

Try It

Planner123 is available now. Download the binary, add your tasks, connect your calendar, and let the solver figure out the rest.

Landing page: solverforge.org/planner123

Get Planner123: Download

Powered by: SolverForge 0.5.2

Related:

• SolverForge 0.5.0: Zero-Erasure Constraint Solving
• solverforge-maps 1.0: Routing Infrastructure for VRP Solvers

• ←Previous
• Next→