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

4000, Nathan, A Castle in the Dordogne

53.00 Sold by: TuPuzzle
Nathan manufactured this excellent puzzle in 1988. The title is A Castle in the Dordogne, with a photograph by T.

1000, Ravensburger, The Daughters of Catulle MendĆØs

26.00 Sold by: TuPuzzle
Ravensburger manufactured this puzzle in 1997. The title is The Daughters of Catulle MendĆØs, by Pierre-Auguste Renoir. The puzzle is

1000, Heye, Fasten Seat Belt, Mordillo

115.00 Sold by: TuPuzzle
Heye manufactured this puzzle in 1991. The title is Fasten Seat Belt, by Guillermo Mordillo, although in 1974 they published

3000, Ravensburger, Political World Map

48.00 Sold by: TuPuzzle
Ravensburger published this puzzle in 1999. The title is Political World Map. The puzzle is like NEW,with all the pieces

1000, Ricordi, Dragon Trip, JosƩ del Nido

25.00 Sold by: TuPuzzle
Ricordi published this rare puzzle in 2006. The title is Dragon Trip, by JosƩ del Nido. The puzzle is NEW,
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