1966–67 Scottish Division Two
The 1966–67 Scottish Division Two was won by Morton who, along with second placed Raith Rovers, were promoted to the First Division. Brechin City finished bottom.
Season | 1966–67 |
---|---|
Champions | Morton |
Promoted | Morton Raith Rovers |
← 1965–66 1967–68 → |
Table
Pos | Team | Pld | W | D | L | GF | GA | GD | Pts | Promotion or relegation |
---|---|---|---|---|---|---|---|---|---|---|
1 | Morton | 38 | 33 | 3 | 2 | 113 | 20 | +93 | 69 | Promotion to the 1967–68 First Division |
2 | Raith Rovers | 38 | 27 | 4 | 7 | 95 | 44 | +51 | 58 | |
3 | Arbroath | 38 | 25 | 7 | 6 | 75 | 32 | +43 | 57 | |
4 | Hamilton Academical | 38 | 18 | 8 | 12 | 74 | 60 | +14 | 44 | |
5 | East Fife | 38 | 19 | 4 | 15 | 70 | 63 | +7 | 42 | |
6 | Cowdenbeath | 38 | 16 | 8 | 14 | 70 | 55 | +15 | 40 | |
7 | Queen's Park | 38 | 15 | 10 | 13 | 78 | 68 | +10 | 40 | |
8 | Albion Rovers | 38 | 17 | 6 | 15 | 66 | 62 | +4 | 40 | |
9 | Queen of the South | 38 | 15 | 9 | 14 | 84 | 76 | +8 | 39 | |
10 | Berwick Rangers | 38 | 16 | 6 | 16 | 63 | 55 | +8 | 38 | |
11 | Third Lanark | 38 | 13 | 8 | 17 | 67 | 78 | −11 | 34 | Club folded |
12 | Montrose | 38 | 13 | 8 | 17 | 63 | 77 | −14 | 34 | |
13 | Alloa | 38 | 15 | 4 | 19 | 55 | 74 | −19 | 34 | |
14 | Dumbarton | 38 | 12 | 9 | 17 | 56 | 64 | −8 | 33 | |
15 | Stranraer | 38 | 13 | 7 | 18 | 57 | 73 | −16 | 33 | |
16 | Forfar Athletic | 38 | 12 | 3 | 23 | 74 | 106 | −32 | 27 | |
17 | Stenhousemuir | 38 | 9 | 9 | 20 | 62 | 104 | −42 | 27 | |
18 | Clydebank | 38 | 8 | 8 | 22 | 59 | 92 | −33 | 24 | |
19 | East Stirlingshire | 38 | 7 | 10 | 21 | 44 | 87 | −43 | 24 | |
20 | Brechin City | 38 | 8 | 7 | 23 | 58 | 93 | −35 | 23 |
Source:
gollark: But not the reliance on channels, as they can be quite tricky.
gollark: I like how it does async IO internally but in a nice way without magic async/await keywords sprinkled everywhere, yes.
gollark: And yet its channels are actually SUBOPTIMAL in SOME SCENARIOS?!
gollark: If I've learned anything from this, it's to avoid triangle grids since hexagons have much more elegant indexing.
gollark: I did the first thing and one of the written questions there (but not the one which wasn't doable by computer since I have no idea how that can actually be answered), and spent ages working out how to implement the second but ran out of time.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.