Learn Before
Concept

Tower of Hanoi Problem

The problem of how to get all of the rings from peg 1 to peg 3 following 3 rules:

    1. move one disc at a time
    1. discs can only move if there aren't any others on it
    1. larger discs can't be placed on smaller ones It is solvable through the use of means-end analysis, subgoals and intermediate states.
Image 0

0

1

Updated 2020-12-15

Tags

Psychology

Social Science

Empirical Science

Science

Related
Learn After