Takuji Miyoshi

Takuji Miyoshi (三好 拓児, Miyoshi Takuji, born August 20, 1978) is a former Japanese football player.

Takuji Miyoshi
三好 拓児
Personal information
Full name Takuji Miyoshi
Date of birth (1978-08-20) August 20, 1978
Place of birth Kitakyushu, Fukuoka, Japan
Height 1.79 m (5 ft 10 1⁄2 in)
Playing position(s) Defender
Youth career
1994–1996 Kunimi High School
Senior career*
Years Team Apps (Gls)
1997–2001 Avispa Fukuoka 18 (0)
2002–2004 Sagan Tosu 54 (2)
2004–2006 ALO's Hokuriku 57 (4)
2007 Valiente Toyama 10 (1)
2007–2008 FC Ryukyu 26 (2)
Total 165 (9)
* Senior club appearances and goals counted for the domestic league only

Playing career

Miyoshi was born in Kitakyushu on August 20, 1978. After graduating from high school, he joined J1 League club Avispa Fukuoka based in his local in 1997. He played several matches as substitute center back from 1999. However he could not play many matches. In 2002, he moved to J2 League club Sagan Tosu. He became a regular player as center back in 2002. However his opportunity to play decreased from 2003. In September 2004, he moved to Japan Football League (JFL) club ALO's Hokuriku. He played as regular player in 3 seasons. In 2007, he moved to Regional Leagues club Valiente Toyama. In July 2007, he moved to JFL club FC Ryukyu. He retired end of 2008 season.

Club statistics
Club performance League Cup League Cup Total
SeasonClubLeague AppsGoals AppsGoals AppsGoals AppsGoals
Japan League Emperor's Cup J.League Cup Total
1997Avispa FukuokaJ1 League00000000
199800000000
199940003070
2000602020100
2001800031111
2002Sagan TosuJ2 League34020-360
200314210-152
20046000-60
2004ALO's HokurikuFootball League6210-72
200527040-310
2006242--242
2007Valiente ToyamaRegional Leagues101--101
2007FC RyukyuFootball League111--111
2008151--151
Career total 16591008118310
gollark: ```lisp (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)))))) )) ))```↑ provably optimal sorting algorithm
gollark: Well, in Haskell you would just use the highly efficient quicksort from somewhere.
gollark: Carbohydrates?
gollark: Oh no. I forgot how merge sort works. Oh apioid.
gollark: Oh, merge sort.

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