D. Discrete Mathematics-Vertex-Edge Graphs and Algorithms 1. Devise strategies for winning simple games (e.g., start with two piles of objects, each of two Circulate, complete, and "Vertex coding" Discrete Mathematics Workshop - Lisa players in turn removes any number of objects from share Ryden, September 2000 a single pile, and the person to take the last group of objects wins) and express those strategies as sets of directions.
D. Discrete Mathematics-Vertex-Edge Graphs and Algorithms 1. Devise strategies for winning simple games (e.g., start with two piles of objects, each of two players in turn removes any number of objects from a single pile, and the person to take the last group of objects wins) and express those strategies as sets of directions. Circulate, complete, and share "Vertex coding" Discrete Mathematics Workshop - Lisa Ryden, September 2000
FINAL_K-6_CURRICULUM_AUGUST_2010.docx