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, Schmidt, Party Time, Young

24.00 Sold by: TuPuzzle
Schmidt manufactured this nice puzzle in 2012. The title is Party Time, by Michael Young. The puzzle is NEW, with

1000, King Cards, A Frigate Outward Bound Off Shoeburyness

24.00 Sold by: TuPuzzle
This is a very rare puzzle by the German manufacturer King Cards. The title is A Frigate Outward Bound Off

1000, Schmidt, As in Heaven!, Schneiders

17.00 Sold by: TuPuzzle
This is a very interesting puzzle by Schmidt, belonging to their Schneiders Composition collection. The title is As in Heaven!,

1000, Nathan, Family Photo, Goscinny & Uderzo

21.00 Sold by: TuPuzzle
Nathan published this puzzle in 2000. The title is Family Photo, with an illustration of the popular comic Asterix, by

3000, Ravensburger, World Map, 1665, Willem Blaeu

55.00 Sold by: TuPuzzle
Ravensburger manufactured this puzzle in 1994. The title in the box is simply World Map, 1665, and there is no reference
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