1992–93 Latvian Hockey League season

The 1992–93 Latvian Hockey League season was the second season of the Latvian Hockey League, the top level of ice hockey in Latvia. Fifteen teams participated in the league, and Pārdaugava Riga won the championship.

1992–93 Latvian Hockey League
LeagueLatvian Hockey Higher League
SportIce hockey
Number of teams15
Regular season
ChampionsPārdaugava Riga
Runners-upLatvijas zelts Riga

Regular season

Group A

Club GP W T L GF:GA Pts
1.RTU-Hanza Riga660086:02212
2.HK Sāga Ķekava Riga641195:0239
3.Dinamo Juniors Riga641171:0149
4.Essamika Ogre630353:0366
5.LJS-Hanza Riga620428:0614
6.Vecmeistars Riga610526:0732
7.Polaks Engure600614:1440

Group B

Club GP W T L GF:GA Pts
1.Pārdaugava Riga7511123:02011
2.Pārdaugava Riga II7511075:03711
3.Latvijas zelts Riga7511114:02411
4.HK Nik's Brih Riga7502080:03110
5.HK Valmiera7304032:0916
6.THK Talsi7205040:1204
7.Dispeceri Riga7115027:0893
8.Smiltenes vanagi7007008:0870

Second round

Final round

Club GP W T L GF:GA Pts
1.Pārdaugava Riga211623175:06734
2.Latvijas zelts Riga211524194:10132
3.Pārdaugava Riga II211524161:12532
4.HK Nik's Brih Riga211308170:11326
5.HK Sāga Ķekava Riga219111158:16919
6.RTU-Hanza Riga217014114:19514
7.Dinamo Juniors Riga213117074:1657
8.Essamika Ogre212019102:2134

Placing round

Club GP W T L GF:GA Pts
1.Vecmeistars Riga14914112:13919
2.HK Valmiera15834111:15719
3.LJS-Hanza Riga14824091:11118
4.THK Talsi15816119:19317
5.Dispeceri Riga15717103:16415
6.Smiltenes vanagi15438069:15711
7.Polaks Engure141112061:2353
gollark: > I never tried it. It's nice that it has these safety features but I prefer C++ still. > If I want to be sure that my program is free of bugs, I can write a formal specification and do a > correctness proof with the hoare calculus in some theorem proofer (People did that for the seL4 microkernel, which is free from bugs under some assumptions and used in satellites, nuclear power plants and such)Didn't doing that for seL4 require several hundred thousand lines of proof code?
gollark: Most countries have insanely convoluted tax law so I assume it's possible.
gollark: Hmm, so you need to obtain a hypercomputer of some sort to write your tax forms such that they cannot plausibly be checked?
gollark: What if it's somehow really easy to find *a* solution to something, but not specific ones, and hard to check the validity of a specific maybe-solution? Is that possible?
gollark: Er, maybe?
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.