3000, Dujardin, La Chasse au Cerf, Bernard van Orley

49.00

In stock

Other Available Vendor

Price 82.00
Rating
Description

This is a rare gem by Dujardin very difficult to find. It represents a tapestry named La Chasse au Cerf, or The Deer Hunt, by Bernard van Orley. The tapestry is part of a series o twelve titled The Hunts of Maximilian, in reference to the German Emperor Maximilian I.

The puzzle is COMPLETE (3008 pieces). The pieces are in excellent condition. Th box is in very good condition, with some tape remnants and stains on the base.

Educa published a similar 3000 piece version in 1990.

More information about La Chasse au Cerf:
  • Puzzle size: 115 x 84 cm.
  • Box size: 41 x 28.5 x 4.7 cm.
  • Reference number: 7936.
  • EAN number: 326219097369.
Shipping
Additional information
Dimensions 41 × 28.5 × 4.7 cm
Number of Pieces

3000

Brand

Dujardin

Condition

Complete

Content

Art

More Products

1000, Ravensburger, Protector of Wolves, Christoph

16.00 Sold by: TuPuzzle
Ravensburger manufactured this puzzle in 2016. The title is Protector of Wolves, by Silvia Christoph. The puzzle is NEW, with

1000, Impronte Edizioni, Railway Bridge at Argenteuil

18.00 Sold by: TuPuzzle
This is a beautiful panorama puzzle by Impronte Edizioni. The title is Railway Bridge at Argenteuil, by Claude Monet. The

1000, D-Toys, Sunflowers, Vincent van Gogh

9.00 Sold by: TuPuzzle
D-Toys manufactured this puzzle in 2016. The title is Sunflowers, by Vincent Van Gogh. This puzzle is COMPLETE (1000 pieces).

1000, Tower Press, In Full Sail

23.00 Sold by: TuPuzzle
This is an old puzzle by Tower Press, belonging to their Imperial series. The title is In Full Sail, and

3000, Ravensburger, Political World Map

48.00 Sold by: TuPuzzle
Ravensburger published this puzzle in 1999. The title is Political World Map. The puzzle is like NEW,with all the pieces
Product Enquiry

Product Enquiry

Your personal data will be used to support your experience throughout this website, to manage access to your account, and for other purposes described in our privacy policy