To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Valerian Onițiu

From Wikipedia, the free encyclopedia

Valerian Onițiu
Oniţiu, Petrović, Dawson & Fox
1st Pr. Kniest TT. 1930
FIDE Album 1914-1944/III
abcdefgh
8
a8 black upside-down queen
f7 black upside-down queen
a2 black pawn
h2 black upside-down queen
a1 black king
c1 white king
h1 white upside-down queen
8
77
66
55
44
33
22
11
abcdefgh
Mate in 8 (with grasshoppers Ga8, f7, h2 and h1)

Valerian Oniţiu (also Valeriu Oniţiu) (April 8, 1872, Sibiu, Romania – 31 December 1948, Timișoara)[1] was a Romanian chess problemist.

Oniţiu composed all types of problems particularly fairy chess problems. Oniţiu has ten chess problems in FIDE Albums.

Onitiu also did significant work on knight's tours. First in Problemist Fairy Chess Supplement (vol.1 no.12 Jun 1932 p.74) problems 452-455 he gives tours with ten three-unit lines. The editor T. R. Dawson states: "V. Onitiu writes to me that he has examined all possible cases, some 1330 in all, and is convinced that only six of them admit tours, namely Dr Hogrefe's , mine, and the following four new ones. Second in Fairy Chess Review (vol.4 no.3 Dec 1939 p.43 problem 4135, with solution in no.6 Jun 1940 p.93.) he gives a symmetric tour with squares in a knight chain. The editor states: "VO notes that he examined 144 dispositions of the squares, all that are possible for diametral symmetry, and this is the only case leading to a tour. Moreover every move of the tour is determined, so that the tour is UNIQUE in all the millions possible."

Problem

The solution of this problem is: 1.Gh3 Gh4 2.Gh5 Gh6 3.Gh7 Gh8 4.Ge7 Gd7 5.Gc7 Gb7 6.Ga7+ Ga6 7.Ga5+ Ga4 8.Ga3#

This problem is a case of incidence of thematic tourney prescript problems with grasshoppers without limiting the number of the moves. Identical problems were sent independently by four composers at about the same time.[2]

References

  1. ^ Gaige, Jeremy (1987), Chess Personalia, A Biobibliography, McFarland, p. 312, ISBN 0-7864-2353-6
  2. ^ Petrovič, Nenad (1949), Šahovski problem, Šahovska centrala, p. 142

Further reading

  • Ştefaniu, Constantin (1984), Şah de la A la Z, Bucharest, p. 304{{citation}}: CS1 maint: location missing publisher (link)

External links

This page was last edited on 10 April 2023, at 00:59
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.