Open de Baleares

The Open de Baleares was a European Tour golf tournament which was played annually from 1988 to 1995. It had five names in eight years. It was staged at various courses on Majorca, the largest of the Balearic Islands of Spain. The most notable winner was five times major championship winner Seve Ballesteros, who won three of the first five events. The prize fund in sterling terms peaked at £302,670 in 1993 and by 1995 it was down to £246,023, which was one of the smallest on the European Tour that year.

Open de Baleares
Tournament information
LocationMallorca, Spain
Established1988
Tour(s)European Tour
FormatStroke play
Final year1995
Tournament record score
Aggregate269 Seve Ballesteros (1990)
269 Magnus Persson (1990)
269 Barry Lane (1994)
To par−19 (as above)
Final champion
Greg Turner

Winners

YearWinnerCountryScoreTo parMargin
of victory
Runner(s)-up
Turespaña Open de Baleares
1995Greg Turner New Zealand274−142 strokes Costantino Rocca
1994Barry Lane England269−192 strokes Jim Payne
Turespaña Iberia Open de Baleares
1993Jim Payne England277−11Playoff Anders Gillner
Turespaña Open de Baleares
1992Seve Ballesteros Spain277−11Playoff Jesper Parnevik
Open de Baleares
1991Gavan Levenson South Africa282−61 stroke Steven Richardson
Open Renault de Baleares
1990Seve Ballesteros Spain269−19Playoff Magnus Persson
1989Ove Sellberg Sweden279−92 strokes Mark McNulty
José María Olazábal
Philip Parkin
Mallorca Open De Baleares
1988Seve Ballesteros Spain272−166 strokes José María Olazábal
gollark: https://yggdrasil-network.github.io/2018/07/17/world-tree.html
gollark: These things mostly just use links over the existing internet, since the few people who are interested mostly don't live near each other.
gollark: It's a mesh network thing. Unlike the normal hierarchical unternet, where people have a link with their ISP, who then connects to an internet exchange or something, mesh nets can have anyone peer with anyone and the routing is automatically worked out. Yggdrasil is quite like the more popular cjdns, but with a different routing algorithm based on a tree which may be more scaleable (it doesn't always return the shortest path, but uses less memory).
gollark: Oh, I run that for arbitrary reasons, it's neat.
gollark: Especially in WAL mode.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.