Lovisa Selander

Lovisa Selander (born 14 March 1996) is a Swedish ice hockey player for the Boston Pride in the National Women's Hockey League and the Swedish national team.

Lovisa Selander
Born (1996-03-14) 14 March 1996
Sollentuna, Sweden
Height 1.81 m (5 ft 11 in)
Weight 73 kg (161 lb; 11 st 7 lb)
Position Goaltender
Catches Left
NWHL team
Former teams
Boston Pride
Ormsta HC
SDE Hockey
RPI Engineers
National team  Sweden
Playing career 2012present

Career

From 2012 to 2015, Selander played for SDE Hockey in her native Sweden.

Selander played four seasons for the RPI Engineers. She currently holds the record for women’s hockey NCAA Division I career saves.[1] In 2019, she served as captain of the team and was named a finalist for the Patty Kazmaier Memorial Award.[2][3]

She was drafted 20th overall by the Pride in the 2018 NWHL Draft.[4] In August 2019, she signed with the team, the second Swede to sign a contract in NWHL history.[5] She was named NWHL Goaltender of the Year in her rookie season, setting NWHL records for most wins in a season and highest SV% in a season.[6] She was also named MVP of the 2020 NWHL All-Star Game.[7]

International

She represented Sweden at the 2019 IIHF Women's World Championship.[8][9][10][11]

In August 2019, Selander took part in the Swedish women's boycott of the national team, in protest over working conditions and compensation.[12][13]

Personal Life

Selander has a degree in chemical engineering.[14][15]

Career Statistics

Regular season Playoffs
SeasonTeamLeague GPWLT/OTMINGASOGAASV% GPWLMINGASOGAASV%
2019-20Boston PrideNWHL 23171010503021.71.941 11060101.00.967
NWHL totals 23171010503021.71.941 11060101.00.967
gollark: It was more elegance™ to just make it able to do tail-call optimization.
gollark: I actually stole this particular quicksort from a r/haskell post talking about it.
gollark: ```lisp (let (partition_rec xs pred acc) (cond ((= xs '()) acc) (true (partition_rec (tail xs) pred (cond ((pred (head xs)) (list (cons (head xs) (head acc)) (snd acc))) (true (list (head acc) (cons (head xs) (snd acc)))) ))) )) (let (qsort xs cont) (cond ((= xs '()) (cont '())) (true (do (let h (head xs)) (let t (tail xs)) (let part_result (partition_rec t (lambda (x) (< x h)) '(() ()))) (qsort (head part_result) (lambda (ls) (qsort (snd part_result) (lambda (rs) (cont (+ ls (list h) rs)))))) )) ))```These all have to be done tail recursively or it could overflow.
gollark: Continuation passing style quicksort in a hilariously slow interpreter.
gollark: It manages *1* second, which is great.

References


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