Ben Marsh

Benjamin Keith Marsh (born 9 July 1976) is a former Australian rules footballer who played with Adelaide and Richmond in the Australian Football League (AFL).

Ben Marsh
Personal information
Full name Benjamin Keith Marsh
Date of birth (1976-07-09) 9 July 1976
Original team(s) West Adelaide (SANFL)
Height 201 cm (6 ft 7 in)
Weight 102 kg (16 st 1 lb; 225 lb)
Position(s) Ruckman / Full forward
Playing career1
Years Club Games (Goals)
1998–2003 Adelaide 48 (17)
2004 Richmond 07 0(1)
Total 55 (18)
1 Playing statistics correct to the end of 2004.
Career highlights
  • AFL Premiership player (1998)
Sources: AFL Tables, AustralianFootball.com

A tall 201 cm ruckman, Marsh made his league debut with West Adelaide in the South Australian National Football League (SANFL) in 1996 and made his AFL debut for Adelaide in 1998 against the Sydney Swans at the Sydney Cricket Ground and played in their Grand Final win over North Melbourne at the Melbourne Cricket Ground.

Marsh remained with the Crows for another five seasons before being delisted at the end of 2003. He was then picked up in the 2004 pre-season draft by Richmond where he would add a further 7 games and one goal to his tally before retiring at the end of 2004.

Statistics

[1]
Legend
 G  Goals  B  Behinds  K  Kicks  H  Handballs  D  Disposals  M  Marks  T  Tackles  H/O  Hit-outs
Season Team No. Games Totals Averages (per game)
G B K H D M T H/O G B K H D M T H/O
1998 Adelaide 31943262046201700.40.32.92.25.12.20.17.8
1999 Adelaide 311000110000.00.00.01.01.00.00.00.0
2000 Adelaide 3112574837853591200.40.64.03.17.12.90.810.0
2001 Adelaide 311877785713540151870.40.44.33.27.52.20.810.4
2002 Adelaide 3161020143497500.20.03.32.35.71.51.28.3
2003 Adelaide 3120120220150.00.51.00.01.01.00.07.5
2004 Richmond 15710192443165730.10.02.73.46.12.30.710.4
Career 55 18 18 193 153 346 122 37 515 0.3 0.3 3.5 2.8 6.3 2.2 0.7 9.4
gollark: As you can see, centre-justification follows from the combination of left- and right-justification.
gollark: Left-justification:> Left-wing politics supports social equality and egalitarianism, often in critique of social hierarchy.[1][2][3][4] Left-wing politics typically involves a concern for those in society whom its adherents perceive as disadvantaged relative to others as well as a belief that there are unjustified inequalities that need to be reduced or abolished.[1] According to emeritus professor of economics Barry Clark, left-wing supporters "claim that human development flourishes when individuals engage in cooperative, mutually respectful relations that can thrive only when excessive differences in status, power, and wealth are eliminated."[5] No language (except esoteric apioforms) *truly* lacks generics. Typically, they have generics, but limited to a few "blessed" built-in data types; in C, arrays and pointers; in Go, maps, slices and channels. This of course creates vast inequality between the built-in types and the compiler writers and the average programmers with their user-defined data types, which cannot be generic. Typically, users of the language are forced to either manually monomorphise, or use type-unsafe approaches such as `void*`. Both merely perpetuate an unjust system which must be abolished.
gollark: Anyway, center-justify... centrism is about being precisely in the middle of the left and right options. I will imminently left-justify it, so centre-justification WILL follow.
gollark: Social hierarchies are literal hierarchies.
gollark: Hmm. Apparently,> Right-wing politics embraces the view that certain social orders and hierarchies are inevitable, natural, normal, or desirable,[1][2][3] typically supporting this position on the basis of natural law, economics, or tradition.[4]:693, 721[5][6][7][8][9] Hierarchy and inequality may be seen as natural results of traditional social differences[10][11] or competition in market economies.[12][13][14] The term right-wing can generally refer to "the conservative or reactionary section of a political party or system".[15] Obviously, generics should exist in all programming languages ever, since they have existed for quite a while and been implemented rather frequently, and allow you to construct hierarchical data structures like trees which are able to contain any type.

References

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