Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2002 — Part 01 Question 138

Math Olympiad Vault · MathNet 2002 — Part 01

Question 138

A 1000-piece puzzle can be assembled by fitting the pieces one after the other, so as to insert each new piece into the already composed portion of the puzzle, or by building several groups of pieces and then joining them together. Each union (of two individual pieces, or of two groups, or of a piece to a group) counts one move. What is the minimum number of moves needed to complete the puzzle?