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

500, MB, Père et Fils, Joëlle Wolff

9.00 Sold by: TuPuzzle
MB manufactured this nice puzzle in 2005. The title is Père et Fils, by Joëlle Wolff. The puzzle is COMPLETE

500, Jumbo, Goal, Jan van Haasteren

10.00 Sold by: TuPuzzle
Jumbo manufactured this puzzle in 1996. The title is Goal, by Jan van Haasteren. The puzzle is COMPLETE (500 pieces).

1000, Ricordi, The Last Judgement, Byzantine Art

22.00 Sold by: TuPuzzle
Ricordi manufactured this puzzle in 2006. The title is The Last Judgement, Byzantine Art, and there is no reference to

1000, Ravensburger, African Beauty, Joadoor

22.00 Sold by: TuPuzzle
Ravensburger manufactured this puzzle in 2005. The title is African Beauty, by Joadoor. The puzzle is NEW, with its original

500, Haarlem, Old Yard in the Netherlands, Hendricks

10.00 Sold by: TuPuzzle
This is a very interesting puzzle published by the municipality of Haarlem, the Netherlands, to collect funds for the restoration
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