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, Innovakids, Santorini

10.00 Sold by: TuPuzzle
Innovakids manufactured this puzzle in 2019. The title is Santorini. The puzzle is COMPLETE (1008 pieces). The pieces are in

1000, RMS, Poppy Field, Claude Monet

11.00 Sold by: TuPuzzle
This is a nice puzzle by RMS, belonging to their Masters series of art puzzles. The title is Poppy Field, by Claude Monet. The

2000, Ricordi, The Colosseum in Rome, Harpignies

29.00 Sold by: TuPuzzle
Ricordi manufactured this puzzle in 2006. The title is The Colosseum in Rome, by Henri Harpignies. The puzzle is NEW,

500, Haarlem, Old Yard in the Netherlands, Hendricks

9.00 Sold by: TuPuzzle
This is a very interesting puzzle published by the municipality of Haarlem, the Netherlands, to collect funds for the restoration

1000, Playfair, Party Puzzle 3203, Mordillo

59.00 Sold by: TuPuzzle
Playfair Products OY manufactured this very nice puzzle in 1973. Since there is no title on the box, we just
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