Multiple choice

The cryptarithmetic puzzle is an example for

  1. problem reduction

  2. constraint satisfaction

  3. best-first-search

  4. all of the above
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Cryptarithmetic puzzles require assigning digits to letters such that the arithmetic holds true, which is a classic example of a constraint satisfaction problem where each letter is a variable with constraints on its possible values.

Keep practicing — related questions