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.2

Graph theory. The student applies the concept of graphs to determine possible solutions to real-world problems.

DM.2.AExplain the concept of graphs.DM.2.BUse graph models for simple problems in management science.DM.2.CDetermine the valences of the vertices of a graph.DM.2.DIdentify Euler circuits in a graph.DM.2.ESolve route inspection problems by Eulerizing a graph.DM.2.FDetermine solutions modeled by edge traversal in a graph.DM.2.GCompare the results of solving the traveling salesman problem (TSP) using the nearest neighbor algorithm and using a greedy algorithm.DM.2.HDistinguish between real-world problems modeled by Euler circuits and those modeled by Hamiltonian circuits.DM.2.IDistinguish between algorithms that yield optimal solutions and those that give nearly optimal solutions.DM.2.JFind minimum-cost spanning trees using Kruskal's algorithm.DM.2.KUse the critical path method to determine the earliest possible completion time for a collection of tasks.DM.2.LExplain the difference between a graph and a directed graph.

1-on-1 AI tutoring aligned to DM.2. 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 →