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, Educa, Queen Victoria’s, Jules Achille Noël

18.00 Sold by: TuPuzzle
Educa manufactured this puzzle in 2001. The title in the box is Queen Victoria’s, by Jules Achille Noël, although the

1000, Schmidt, The Visitation

19.00 Sold by: TuPuzzle
This is a beautiful and very rare puzzle by Schmidt. The title is The Visitation, by the Master of the

48, Heye, Riding Indians, Guillermo Mordillo

14.00 Sold by: TuPuzzle
Heye manufactured this puzzle in 1988, as part of their Mini Puzzle series. It seems all the puzzles in the

2000, Ravensburger, Return of the Fisherman

49.00 Sold by: TuPuzzle
Ravensburger manufactured this puzzle in 1983. The title is Return of the Fisherman, with a photograph by David Hamilton. The

1000, D-Toys, Romantic Winter Landscape with Ice Skaters by a Castle

19.00 Sold by: TuPuzzle
D-Toys manufactured this beautiful puzzle in 2021. The title is Romantic Winter Landscape with Ice Skaters by a Castle, by
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