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, Impronte Edizioni, Inner Courtyard of House in Saint Germain

24.00 Sold by: TuPuzzle
This is a beautiful puzzle by Impronte Edizioni. The title is Inner Courtyard of House in Saint Germain, by August

1000, Jumbo, Winter Landscape, George Vicat Cole

21.00 Sold by: TuPuzzle
This is a very nice puzzle by Jumbo. The title is Winter Landscape, by George Vicat Cole. The puzzle is

1000, Ricordi, A Boy with a Pipe, Pablo Picasso

18.00 Sold by: TuPuzzle
Ricordi manufactured this very nice puzzle in 2006. The title is A Boy with a Pipe, by Pablo Picasso. The

1500, Educa, Gondolas in Venice (Panorama)

19.00 Sold by: TuPuzzle
Educa manufactured this puzzle in 2003, as part of their Panorama series. The title is Gondolas in Venice. The puzzle

1500, Nathan, Bouquet of Flowers, Delacroix

12.00 Sold by: TuPuzzle
Nathan manufactured this rare puzzle in 1977. The title is Bouquet of Flowers, by Eugène Delacroix. The puzzle is COMPLETE
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