Liesette Bruinsma

Liesette Bruinsma (born 9 September 2000) is a Dutch Paralympic swimmer.[1] She competes in S11 classification events for athletes with visual impairments. She is the 2016 double Paralympic champion within her classification.

Liesette Bruinsma
Personal information
NationalityDutch
Born (2000-09-09) 9 September 2000
ResidenceWommels, Netherlands
Sport
Disability classS11,
ClubHZ&PC Heerenveen
Coached byCasper Hut (club)
Mark Faber (national)
Medal record
Women's para swimming
Representing  Netherlands
Paralympic Games
2016 Rio200 m individual medley S11
2016 Rio400 m freestyle S11
2016 Rio100 m breaststroke S11
2016 Rio50 m freestyle S11
2016 Rio100 m freestyle S11
European Championships
2016 Funchal400 m freestyle S11
2016 Funchal100 m breaststroke SB11
2016 Funchal200 m find. medley SM11
2018 Dublin100 m freestyle S11
2018 Dublin400 m freestyle S11
2018 Dublin100 m breaststroke S11
2018 Dublin200 m individual medley S11
2016 Funchal50 m freestyle S11
2018 Dublin50 m freestyle S11
2016 Funchal100 m freestyle S11

Swimming career

Bruinsma first competed for the Netherlands at Glasgow in 2014.[2] Her first major international competition was the 2016 IPC Swimming European Championships in Funchal, where she competed in six events, and took a medal in five of them. Three of her Funchal medal's were gold: 400 m freestyle (S11), 100 m breaststroke (SB11) and the 200 m find. medley (SM11).

In the same year, Bruinsma made her Paralympic Games debut, winning five medals including two golds in the 200 metres individual medley and the 400 metres freestyle.

The Netherlands did not send a team to the 2017 World Para Swimming Championships in Mexico city, but Bruinsma dominated at the 2018 World Para Swimming European Championships, winning four gold medals and breaking two world records, taking her tally of European Championships titles to seven.

gollark: ```scheme(define (take n xs) (let loop ((n n) (xs xs) (zs (list))) (if (or (zero? n) (null? xs)) (reverse zs) (loop (- n 1) (cdr xs) (cons (car xs) zs)))))(define (zip . xss) (apply map list xss))(define actually-forgiving-grudge (lambda (x y) (let* ( (defection-count (length (filter (lambda (m) (= m 1)) x))) (lookback (+ 1 (inexact->exact (floor (expt 1.8 defection-count))))) (result (if (member '(1 0) (take lookback (zip x y))) 1 0)) ) result)))```if you want to add it to your stuff.
gollark: Do you like `actually-forgiving-grudge`?!
gollark: https://github.com/cristal-smac/ipd - huh
gollark: > [Edit] Worth to note is that Gradual was designed to be a strategy that outperforms Tit for Tat. It has similar properties in that it is willing to cooperate and retaliates against a defecting opponent. Unlike Tit for Tat, which only has a memory of the last round played, Gradual will remember the complete interaction and defect the number of times the opponent has defected so far. It will offer mutual cooperation afterwards again, though.
gollark: The *description* of "Gradual" is pretty understandable.

References
  1. "Liesette Bruinsma". rio2016.com. Retrieved 7 September 2016.
  2. "Bruinsma, Liesette". IPC (in Dutch). Retrieved 7 September 2016.


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