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, Nathan, The Duelists, Jack Vettriano

27.00 Sold by: TuPuzzle
Nathan manufactured this puzzle in 1999, as part of their Vettriano collection. The title is The Duelists, by Jack Vettriano.

1000, Ravensburger, Gripsholm Palace

9.00 Sold by: TuPuzzle
Ravensburger manufactured this puzzle in the 1972 as part of their Royal series. The title is Gripsholm Palace. The puzzle

1000, JB, Station, Frits van Bemmel

4.00 Sold by: TuPuzzle
This is a very rare puzzle by the company JB, belonging to their Indonesia series. The title is Station. There

1000, Diset, The Story of Nastaglio, Botticelli

22.00 Sold by: TuPuzzle
Diset manufactured this rare puzzle in 1998. The title is The Story of Nastaglio, by Sandro Botticelli. The puzzle NEW,

1000, Nathan, Course de Dauphins, Stephen Frink

13.00 Sold by: TuPuzzle
Nathan manufactured this interesting puzzle in 2005, as part of their Animaux collection. The title is Course de Dauphins, with
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