1914 Rose Polytechnic football team

The 1914 Rose Polytechnic football team represented the Rose Polytechnic Institute during the 1914 college football season.[1]

1914 Rose Polytechnic football
ConferenceIndependent
1914 record0–7
Head coachHerbert Huebel (2nd season)
1914 Midwestern college football independents records
Conf  Overall
TeamW L T  W L T
Western State (MI)      6 0 0
Notre Dame      6 2 0
Michigan Agricultural      5 2 0
Butler      4 2 0
South Dakota      5 2 1
Michigan      6 3 0
North Dakota Agricultural      5 3 0
Haskell      5 4 0
Michigan State Normal      3 2 1
Heidelberg      4 3 1
Akron      4 4 1
Doane      3 3 2
Fairmount      3 3 1
St. Mary's (OH)      2 2 0
Wabash      2 2 2
Detroit      2 3 2
Lake Forest      3 5 0
Iowa State Teachers      2 5 1
Marquette      2 7 0
Rose Poly      0 7 0

Schedule

DateOpponentSiteResultSource
October 3at Eastern IllinoisCharlston, ILL 6–23
October 10at Notre DameL 0–103[2]
October 17at Wabash
L 6–34
October 24at DePauwGreencastle, INL 0–20
October 31FranklinTerre Haute, INL 0–7
November 7EarlhamTerre Haute, INL 7–26
November 21LouisvilleTerre Haute, INL 0–23
gollark: I think this is technically possible to implement, so bee⁻¹ you.
gollark: This is underspecified because bee² you, yes.
gollark: All numbers are two's complement because bee you.
gollark: The rest of the instruction consists of variable-width (for fun) target specifiers. The first N target specifiers in an operation are used as destinations and the remaining ones as sources. N varies per opcode. They can be of the form `000DDD` (pop/push from/to stack index DDD), `001EEE` (peek stack index EEE if source, if destination then push onto EEE if it is empty), `010FFFFFFFF` (8-bit immediate value FFFFFFFF; writes are discarded), `011GGGGGGGGGGGGGGGG` (16-bit immediate value GGGGGGGGGGGGGGGG; writes are also discarded), `100[H 31 times]` (31-bit immediate because bee you), `101IIIIIIIIIIIIIIII` (16 bits of memory location relative to the base memory address register of the stack the operation is conditional on), `110JJJJJJJJJJJJJJJJ` (16 bit memory location relative to the top value on that stack instead), `1111LLLMMM` (memory address equal to base memory address of stack LLL plus top of stack MMM), or `1110NNN` (base memory address register of stack MMM).Opcodes (numbered from 0 in order): MOV (1 source, as many destinations as can be parsed validly; the value is copied to all of them), ADD (1 destination, multiple sources), JMP (1 source), NOT (same as MOV), WR (write to output port; multiple sources, first is port number), RE (read from input port; one source for port number, multiple destinations), SUB, AND, OR, XOR, SHR, SHL (bitwise operations), MUL, ROR, ROL, NOP, MUL2 (multiplication with two outputs).
gollark: osmarksISA™️-2028 is a VLIW stack machine. Specifically, it executes a 384-bit instruction composed of 8 48-bit operations in parallel. There are 8 stacks, for safety. Each stack also has an associated base memory address register, which is used in some "addressing modes". Each stack holds 64-bit integers; popping/peeking an empty stack simply returns 0, and the stacks can hold at most 32 items. Exceeding a stack's capacity is runtime undefined behaviour. The operation encoding is: `AABBBCCCCCCCCC`:A = 2-bit conditional operation mode - 0 is "run unconditionally", 1 is "run if top value on stack is 0", 2 is "run if not 0", 3 is "run if first bit is ~~negative~~ 1".B = 3-bit index for the stack to use for the conditional.C = 9-bit opcode (for extensibility).

References

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