Minoru Kobata

Minoru Kobata (小畑 穣, Kobata Minoru, born November 24, 1946) is a former Japanese football player. He played for Japan national team.

Minoru Kobata
小畑 穣
Personal information
Full name Minoru Kobata
Date of birth (1946-11-24) November 24, 1946
Place of birth Saitama, Saitama, Japan
Playing position(s) Midfielder
Youth career
1962–1964 Johoku High School
1965–1968 Meiji University
Senior career*
Years Team Apps (Gls)
1969–1975 Hitachi 99 (22)
Total 99 (22)
National team
1970–1973 Japan 13 (0)
* Senior club appearances and goals counted for the domestic league only

Club career

Kobata was born in Saitama on November 24, 1946. After graduating from Meiji University, he joined Hitachi in 1969. In 1972, the club won Japan Soccer League and Emperor's Cup. The club also won 1975 Emperor's Cup. He retired in 1975. He played 99 games and scored 22 goals in the league. He was selected Best Eleven in 1970.

National team career

On July 31, 1970, Kobata debuted for Japan national team against Hong Kong. In December, he was selected Japan for 1970 Asian Games. He also played at 1974 World Cup qualification in 1973. He played 13 games for Japan until 1973.[1]

Club statistics

Club performance League
Season Club League AppsGoals
Japan League
1969HitachiJSL Division 1130
1970142
1971121
1972126
1973144
1974174
1975175
Total 9922

National team statistics

[1]

Japan national team
YearAppsGoals
1970110
197100
197200
197320
Total130

Awards

gollark: Like how in theory on arbitrarily big numbers the fastest way to do multiplication is with some insane thing involving lots of Fourier transforms, but on averagely sized numbers it isn't very helpful.
gollark: It's entirely possible that the P = NP thing could be entirely irrelevant to breaking encryption, actually, as it might not provide a faster/more computationally efficient algorithm for key sizes which are in use.
gollark: Well, that would be inconvenient.
gollark: Increasing the key sizes a lot isn't very helpful if it doesn't increase the difficulty of breaking it by a similarly large factor.
gollark: I'm not sure what P = NP would mean for that. Apparently doing that is non-polynomial time, and a constructive P = NP proof would presumably let you construct a polynomial-time algorithm.

References


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