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, Falcon, In Days of Olde, Thompson

27.00 Sold by: TuPuzzle
This is a very rare puzzle by Falcon. The title is In Days of Olde, with an illustration by Graham

1000, Educa, The Meeting on the Turret Stairs

20.00 Sold by: TuPuzzle
Educa manufactured this beautiful puzzle in 2003. The title is The Meeting on the Turret Stairs, by the Irish artist

1000, Ravensburger, The Montmorency Falls, Krieghoff

24.00 Sold by: TuPuzzle
Ravensburger published this rare puzzle in 2000. The title in the box is The Montmorency Falls, by Cornelius Krieghoff. The

1000, MB, Rhododendron, David Muench

16.00 Sold by: TuPuzzle
MB manufactured this puzzle in 1990. The title is Rhododendron, with a photograph by David Muench. The puzzle is NEW,

1000, Clementoni, Sistine Madonna, Raphael

19.00 Sold by: TuPuzzle
Clementoni published this lovely puzzle as part of their Museum Collection series. Most people identify these two cherubs with Raphael and
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