Is Goblins free for teachers?

Yes. Goblins offers a generous free tier that includes 1 live feedback assignment per week, insights on student mastery and replays, and the ability to upload your own content. The Max plan adds unlimited assignments, superadaptive mode, grade exports, standards growth reports, and SSO/LMS integration, with per-student pricing for schools and districts.

How does Goblins work?

Three simple steps: (1) Share an assignment from thousands of standards-aligned topics using a share code. (2) Students speak and draw their thinking naturally, and Goblins responds with Socratic questioning that sounds just like their teacher. (3) Teachers get real-time formative insights showing what students struggle with and suggestions to inform instruction.

Does Goblins prevent cheating?

Yes. Goblins uses a purpose-trained AI model that evaluates cheating signals in real time. It can detect when students are copying answers, using external tools inappropriately, or not genuinely working through problems. Copy-pasting answers is also blocked.

Can I use my own voice with Goblins?

Yes. Teachers can record their voice and take a selfie to create a custom 3D avatar in about 30 seconds. Students then hear help in their own teacher's voice and see a familiar face, making the experience more personal and effective.

What math levels does Goblins cover?

Goblins covers math from Grade 5 through AP Calculus, including thousands of standards-aligned topics. Teachers can also upload their own content for custom assignments at any level.

Is Goblins FERPA compliant?

Yes. Goblins is FERPA and state compliant. Student data privacy and security are a top priority.

Does Goblins support English Language Learners?

Yes. Goblins supports 30+ languages so teachers don't have to translate every worksheet. It is especially helpful for ELL students who need accessible math instruction in their native language.

DM.GT.4

The student will recognize and apply algorithms to solve configuration, conflict resolution, and sorting problems.

DM.GT.4.aRecognize algorithms such as nearest neighbor, brute force, and cheapest link as they apply to graphs.DM.GT.4.bUse Kruskal’s algorithm to determine the shortest spanning tree of a connected graph.DM.GT.4.cUse Prim’s algorithm to determine the shortest spanning tree of a connected graph.DM.GT.4.dUse Dijkstra’s algorithm to determine the shortest spanning tree of a connected graph.

1-on-1 AI tutoring aligned to DM.GT.4. Instant help for students, real-time insights for teachers.

Used in classrooms by 100,000+ students at Baltimore County, Plano ISD, Deer Valley USD, KIPP, and districts nationwide.

Free for teachers, forever →