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 Open Sea, Bonnec Brothers

26.00 Sold by: TuPuzzle
Nathan manufactured this very nice puzzle in 1995. The title is The Open Sea, by Alain & Daniel Bonnec, although

1500, MB, Le Château Gué Péan

2.00 Sold by: TuPuzzle
MB manufactured this old puzzle in 1974, as part of their Belle France collection. The title is Le Château Gué

1000, MB, Absinthe Berthelot, Henri Thiriet

25.00 Sold by: TuPuzzle
MB manufactured this puzzle in 1979. The title is Absinthe Berthelot, with a classic poster by Henri Thiriet. The puzzle

500, Wentworth, London, The Thames with View of the City and St Paul’s Cathedral

64.00 Sold by: TuPuzzle
This is an exquisite wooden puzzle by Wentworth. The title is London, The Thames with View of the City and

3000, Educa, Typus Orbis Terrarum, Ortelius

55.00 Sold by: TuPuzzle
Educa manufactured this puzzle in 1988. The title is Typus Orbis Terrarum, by Abraham Ortelius, although the title in the
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