Abstract
129 college students were individually requested to successively turn 2 of 3 upright triangles upside-down. Triangle A consists of 3 rows of coins: 1 on top, 2 in the middle, and 3 at the bottom. Only 2 coins may be relocated. Triangle B has 4 rows with 4 coins at the bottom. Only 3 coins may be moved. Triangle C is arranged in 5 rows with 5 coins at the bottom. Only 5 coins are allowed to change places. Analysis shows (a) Problem A is the easiest, B in between, and C the hardest. (b) Overt manipulation is more efficient than a covert method. (c) Transfer in all cases is positive, the amount increasing with difficulty of the preceding problem. (d) From easy to difficult problems is more economical than the opposite sequence as measured by the total time required to solve both problems. The advantage is a little greater under the overt than the covert condition.
Get full access to this article
View all access options for this article.
