Puzzle Booklet - a2 + b2 + c2 = d2
External links may contain spoilers. Proceed with caution.
Links
Videos
No videos yet.
Blogs / Reviews
No blogs or reviews yet.
Values for auctions have all been converted to USD using conversion rates from the actual date of the auction.
Auctions
Click here to help connect auctions to this puzzle
Values for auctions have all been converted to USD using conversion rates from the actual date of the auction.
Auctions
Rating
-/10
Difficulty
-/10
Time
- min
Puzzle Booklet - a2 + b2 + c2 = d2
Tags:
Tags:
| Designed By: | |
| Made By: | |
| Category: | 2D Packing / Assembly |
Rating
-/10
Difficulty
-/10
Time
- min
| Description | |
|
One of a series of booklets produced in Hungary by hand in limited editions; their contents are made of laser cut wood.
The Hungarian mathematician Farkas Bolyai proved that any two polygons with the same area can be dissected into each other. This puzzle beautifully shows an extension of this theorem. Here, two polygons are dissected into one. Reference: Greg N. Frederickson, Dissections: Plane & Fancy |
|
| Goal | |
|
The first goal is to fill the three squares with all 7 pieces.
The second goal is to fit all the pieces into the biggest square hole. |
|
| More Information: | Retail Price (USD): |
Official difficulty level from the designer/maker if given.
Difficulty Level:
|
|
Add info
|
Add info
|
Add info
|
| Number of Moves: | Material: | Variants: |
|
Add info
|
Add info
|
|
| Available From: | Number of Pieces: | Number Released: |
|
Add info
|
Add info
|
Add info
|
| Quality: | Release Date: | Rotations Required: |
|
Craftsman Quality, Limited Production
|
Add info
|
Add info
|
| Material: | Retail Price (USD): |
|
Add info
|
|
| Quality: | Variants: |
|
Craftsman Quality, Limited Production
|
Add info
|
| Number of Pieces: | Release Date: |
|
Add info
|
Add info
|
| Available From: | More Information: |
|
Add info
|
Add info
|
| Number Released: |
Official difficulty level from the designer/maker if given.
Difficulty Level:
|
|
Add info
|
Add info
|
| Number of Moves: | Rotations Required: |
|
Add info
|
Add info
|
Add New Similar Puzzle