Toy problem

A toy problem is useful to test and demonstrate methodologies.

Researchers can use toy problems to compare the performance of different algorithms.

For instance, while engineering a large system, the large problem is often broken down into many smaller toy problems which have been well understood in detail.

As an example, in the field of artificial intelligence, classical puzzles, games and problems are often used as toy problems.

These include sliding-block puzzles, N-Queens problem, missionaries and cannibals problem, tic-tac-toe, chess,[1] Tower of Hanoi and others.