skip to content
A complete defence to 1P-K4 : a study of Petroff's defence Preview this item
ClosePreview this item
Checking...

A complete defence to 1P-K4 : a study of Petroff's defence

Author: Bernard Cafferty; David Hooper
Publisher: Oxford ; New York : Pergamon Press, 1979.
Series: Pergamon international library of science, technology, engineering, and social studies.; Pergamon chess series.
Edition/Format:   Book : English : 2d ed
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Bernard Cafferty; David Hooper
ISBN: 0080240895 9780080240893 0080240887 9780080240886
OCLC Number: 4494287
Notes: First ed. by David Hooper.
Includes index.
Description: xiv, 149 pages : illustrations ; 26 cm.
Series Title: Pergamon international library of science, technology, engineering, and social studies.; Pergamon chess series.
Responsibility: by Bernard Cafferty and David Hooper.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/4494287>
library:oclcnum"4494287"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/4494287>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:bookEdition"2d ed."
schema:contributor
schema:creator
schema:datePublished"1979"
schema:exampleOfWork<http://worldcat.org/entity/work/id/1806663786>
schema:inLanguage"en"
schema:name"A complete defence to 1P-K4 : a study of Petroff's defence"@en
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.