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

1500, Jumbo, The First Birthday, Frederick Daniel Hardy

20.00 Sold by: TuPuzzle
This is a very nice puzzle by Jumbo.The title is The First Birthday, by Frederick Daniel Hardy. The puzzle is

1000, Nathan, Two-Faced Woman

21.00 Sold by: TuPuzzle
Nathan manufactured this rare puzzle in 1993, as part of their Fantastique collection. The title is Two-Faced Woman, but there

3000, Nathan, Bouquet of Flowers, Schneiders

33.00 Sold by: TuPuzzle
Nathan manufactured this puzzle in 1991. The title is Bouquet of Flowers, with a photograph by Ulrike Schneiders. Th puzzle

3000, Nathan, Crimson Light

34.00 Sold by: TuPuzzle
Nathan manufactured this challenging puzzle in 1995, belonging to their Evasion collection. The title is Crimson Light. The puzzle is

1500, Nathan, Golfer’s Retreat, Bildagentur Huber

16.00 Sold by: TuPuzzle
This is a very nice puzzle by Nathan. The title is Golfer’s Retreat, with a photograph by Bildagentur Huber. 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