In this assignment, students write a function that finds the highest scoring word that can be formed from a list of letters, as in the game Scrabble. Students must use recursion, list comprehension, and lambda functions to find all the possible words that can be formed from the given list of letters. In addition to reviewing recursion and lists, this assignment requires students to decompose and document their code. This activity is particularly useful for students who are new to recursion and lists.
Add discussion prompts and opportunities for students to test another student's program to increase the level of Student-Student Interactions as the students develop their program.
Uses a game from students' own experience to Employ Meaningful and Relevant Content.