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

660, Tower Press, Springtime

17.00 Sold by: TuPuzzle
This is an old puzzle by Tower Press. The title is Springtime, but there is no reference to the artist

500, Clementoni, The Holy Family, Michelangelo

24.00 Sold by: TuPuzzle
This is an extraordinary and rare puzzle by Clementoni. The title is Doni Tondo, sometimes called The Holy Family, by

1000, Ravensburger, Monte Carlo Circus, Fischer

27.00 Sold by: TuPuzzle
Ravensburger manufactured this puzzle in 1997. The title is Monte Carlo Circus, by Sally Caldwell Fisher. The puzzle is COMPLETE

1000, Nathan, The Wellspring (Metallic)

25.00 Sold by: TuPuzzle
Nathan manufactured this puzzle in 1996, as part of their Metallic Puzzle collection. The title is The Wellspring, with an

500, Waddingtons, An Omnibus Ride to Piccadilly Circus

15.00 Sold by: TuPuzzle
Waddingtons manufactured this puzzle in 1992. The title is An Omnibus Ride to Piccadilly Circus, by Alfred Morgan. The puzzle
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