Computer Science · 11th Grade

Active learning ideas

Problem-Solving Strategies: Heuristics

Active learning lets students experience the trade-off between speed and precision that defines heuristics. By working through real-world scenarios like route planning and resource allocation, students see why exact solutions are often impractical and how heuristics provide workable answers efficiently.

• Common Core State Standards
• CSTA: 3B-AP-12

• 20–35 min
• Pairs → Whole Class
• 4 activities

Activity 01

• Think-Pair-Share
• 20 min · Pairs

Think-Pair-Share: Traveling Salesman Preview

Students receive a map with 6 cities and must find the shortest route visiting all. They attempt it individually, then compare strategies with a partner. Groups share their routes and the class discusses why finding the optimal route gets exponentially harder as cities increase, motivating the need for heuristics.

Explain the concept of a heuristic and its role in problem-solving.

Facilitation Tip

During the Think-Pair-Share on Traveling Salesman, circulate and listen for students to explicitly name the heuristic they used before they share with the class.

What to look for

Present students with two scenarios: one where an exact solution is feasible (e.g., sorting a list of 10 numbers) and one where it is not (e.g., finding the shortest route visiting 100 cities). Ask: 'Why is an exact algorithm suitable for the first scenario but not the second? What kind of approach would be better for the second, and why?'

• Understand
• Apply
• Analyze
• Self-Awareness
• Relationship Skills

Activity 02

• Gallery Walk
• 35 min · Small Groups

Gallery Walk: Heuristic Strategy Posters

Small groups each design a heuristic approach for a different optimization problem (bin packing, scheduling, route planning) and post their strategies. Other groups tour the gallery and evaluate whether each heuristic would reliably find a good solution, noting edge cases where it might fail badly.

Analyze scenarios where a heuristic approach is more appropriate than an exact algorithm.

Facilitation Tip

When running the Gallery Walk, post a simple rubric near each poster so students know what to look for when evaluating strategies.

What to look for

Provide students with a simplified version of the Traveling Salesperson Problem (e.g., 5 cities). Ask them to apply a simple greedy heuristic (e.g., always go to the nearest unvisited city) and record the total distance. Then, ask them to briefly describe why this method is a heuristic and not an exact solution.

• Understand
• Apply
• Analyze
• Create
• Relationship Skills
• Social Awareness

Activity 03

• Simulation Game
• 25 min · Small Groups

Simulation Game: Greedy Knapsack Challenge

Groups receive sets of item cards with weight and value and must fill a knapsack using a greedy heuristic (highest value-to-weight ratio first). Groups compare final values across different greedy strategies, then attempt to find a better solution by hand to see where the heuristic falls short.

Design a simple heuristic to find a 'good enough' solution for a given problem.

Facilitation Tip

In the Greedy Knapsack simulation, pause after each round to ask teams to record why their current total is acceptable even if another team’s total is higher.

What to look for

On an index card, have students define 'heuristic' in their own words and provide one specific example of a real-world application where heuristics are used. They should also state one advantage of using a heuristic over an exact algorithm.

• Apply
• Analyze
• Evaluate
• Create
• Social Awareness
• Decision-Making

Activity 04

• Formal Debate
• 30 min · Pairs

Formal Debate: Exact vs. Approximate

Present a delivery company routing 500 packages and assign half the class to argue for exact algorithms, half for heuristics. After the debate, both sides collaboratively write a one-paragraph recommendation for when each approach is appropriate.

Explain the concept of a heuristic and its role in problem-solving.

Facilitation Tip

During the Structured Debate, assign one student to keep track of the strongest points on each side so the closing summary is data-driven.

What to look for

Present students with two scenarios: one where an exact solution is feasible (e.g., sorting a list of 10 numbers) and one where it is not (e.g., finding the shortest route visiting 100 cities). Ask: 'Why is an exact algorithm suitable for the first scenario but not the second? What kind of approach would be better for the second, and why?'

• Analyze
• Evaluate
• Create
• Self-Management
• Decision-Making

A few notes on teaching this unit

Teach heuristics by letting students feel the pain of intractable problems first, then introduce strategies as relief. Avoid overwhelming them with algorithmic detail; focus on pattern recognition and quick decision-making. Research shows students grasp heuristics faster when they compare multiple strategies side-by-side and see consistent performance across varied inputs.

Students will demonstrate they can identify when heuristics are appropriate, apply at least two strategies to sample problems, and explain why good-enough solutions can be preferable to perfect ones in constrained contexts. Look for clear articulation of trade-offs and confident use of terminology.

---

Watch Out for These Misconceptions

• During Think-Pair-Share: Traveling Salesman Preview, watch for students to dismiss nearest-city heuristics as random guesses.

  Use the shared list of routes and distances to calculate the total for each nearest-city path, then ask the class to compare totals across multiple runs to show the method’s consistency rather than randomness.

• During Structured Debate: Exact vs. Approximate, watch for students to claim that GPS routing must find the absolute shortest path.

  Refer to the debate’s running tally of route times and distances, highlighting that the displayed route changes with traffic updates to show that ‘good enough’ is the only practical goal.

• During Gallery Walk: Heuristic Strategy Posters, watch for students to assume heuristics only help with packing or traveling.

  Point to posters labeled ‘spam filter’ and ‘game AI’ and ask students to explain how a simple rule like ‘flag messages with urgent language’ acts as a heuristic in those domains.

---

Methods used in this brief

• Think-Pair-Share
• Gallery Walk
• Simulation Game
• Formal Debate