Women's World Chess Championship 1959

The 1959 Women's World Chess Championship was won by Elisabeth Bykova, who successfully defended her title in a match against challenger Kira Zvorykina.

1959 Candidates Tournament

The Candidates Tournament was held in Plovdiv in May 1959 and won by Zvorykina, who earned the right to challenge the reigning champion Bykova for the title.[1]

1959 Women's Candidates Tournament
Player123456789101112131415PointsTie break
1 Kira Zvorykina (Soviet Union)-½½½½1½1111111111½
2 Verica Nedeljković (Yugoslavia)½-½1111½10111½½10½
3 Larissa Volpert (Soviet Union)½½-½½01½1110111
4 Salme Rootare (Soviet Union)½0½-½01½11½½111954.00
5 Edith Keller-Herrmann (East Germany)½0½½-0½11½1½111953.50
6 Milunka Lazarević (Yugoslavia)00111-01010½½118
7 Eva Ladanyike-Karakas (Hungary)½000½1-0½1½½111
8 Valentina Borisenko (Soviet Union)0½½½001-0½½111½7
9 Olga Rubtsova (Soviet Union)000001½1-0½1½11
10 Kveta Eretova (Czechoslovakia)0100½00½1-½½1½½6
11 Gisela Kahn Gresser (USA)000½01½½½½-½½01
12 Elfriede Rinder (West Germany)001½½½½00½½-0½033.75
13 Maria Pogorevici (Romania)00000½00½0½1-1120.50
14 Paunka Todorova (Bulgaria)0½0000000½1½0-1
15 Soledad Gonzalez de Huguet (Argentina)0½00000½0½0100-

1959 Championship Match

The championship match was played in Moscow in 1959. Bykova won comfortably and retained her title.[2]

Women's World Championship Match 1959
12345678910111213Total
 Elisabeth Bykova (Soviet Union) 01½10½1½½111½
 Kira Zvorykina (Soviet Union) 10½01½0½½000½
gollark: Ridiculous. We *need* to be able to break maths in a snippet of code.
gollark: Here is a copy of the code I don't understand from the old version:```lualocal function descend(intermediateFn, terminalFn, i) local pattern = patterns[i] if pattern then intermediateFn(pattern) local pqty = pattern.qty -- Qty keys must be removed from the pattern for collation -- Otherwise, it shows up as a number stuck in the items needed table, which is bad. pattern.qty = nil local needs = util.collate(pattern) pattern.qty = pqty local has = {} for slot, item in pairs(pattern) do if util.satisfied(needs, has) then break end if patterns[item] then descend(intermediateFn, terminalFn, item) has[item] = (has[item] or 0) + (patterns[item].count or 1) end end else terminalFn(i) endendlocal function cost(i) local items = {} descend(function() end, function(i) table.insert(items, i) end, i) return util.collate(items)endlocal function tasks(i) local t = {} descend(function(pat) table.insert(t, pat) end, function() end, i) return tend```
gollark: Also, implementing whatever is done internally for finding free space to transfer to is hard!
gollark: I'm unlikely to have stupidly large autocrafting trees.
gollark: As long as it doesn't take more than a second it fits within my performance goals.

References

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