Tetriminos

A lightweight Tetris clone written in Java as a final project for COSC 1320. This presentation covers the basic program design and two significant algorithms employed.

Transcript

1. TETRIS brandon popson maxwell ciotti
2. OVERVIEW o task allocation o uml diagrams o use case diagrams o randomization algorithm o rotation algorithm
3. TASK ALLOCATION BRANDON o layout o theme music o tetriminos o randomization o scoring MAXWELL o menus o rotation o hold, next o levels o game over o sound effects
4. UML CLASS DIAGRAM Tetrimino IShape JShape LShape Oshape SShape TShape ZShape Screen GameScreen MenuScreen OptionScreen TopScoreScreen TransitionScreen
5. UML USE CASE DIAGRAM pause move piece drop piece rotate piece move left move right move down GAME PIECE rotate <<uses>> <<extends>> <<extends>> <<extends>>
6. RANDOMIZATION algorithm
7. RANDOMIZATION 0 1 2 3 4 5 6 constructor generate queue next piece initialize empty array create piece mapping last 0 1 2 4 6 5 3
8. RANDOMIZATION 0 2 1 1 2 6 3 3 4 5 5 4 6 0 constructor generate queue next piece fill array with unique integers last
9. RANDOMIZATION 0 2 1 1 2 6 3 3 4 5 5 4 6 0 constructor generate queue next piece return last element decrement last pointer last return 0
10. RANDOMIZATION 0 2 1 1 2 6 3 3 4 5 5 4 6 0 constructor generate queue next piece return last element decrement last pointer last return 4
11. RANDOMIZATION 0 2 1 1 2 6 3 3 4 5 5 4 6 0 constructor generate queue next piece return last element decrement last pointer last return 5
12. RANDOMIZATION 0 2 1 1 2 6 3 3 4 5 5 4 6 0 constructor generate queue next piece return last element decrement last pointer last return 3
13. RANDOMIZATION 0 2 1 1 2 6 3 3 4 5 5 4 6 0 constructor generate queue next piece return last element decrement last pointer last return 6
14. RANDOMIZATION 0 2 1 1 2 6 3 3 4 5 5 4 6 0 constructor generate queue next piece return last element decrement last pointer last return 1
15. RANDOMIZATION 0 2 1 1 2 6 3 3 4 5 5 4 6 0 constructor generate queue next piece return last element decrement last pointer last return 2
16. RANDOMIZATION 0 3 1 4 2 1 3 0 4 5 5 2 6 6 constructor generate queue next piece fill array with unique integers last
17. ROTATION algorithm
18. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end J-tetrimino
19. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end central mino index = 1
20. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end select mino 0
21. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end mino movement 1
22. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end mino movement 2
23. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end mino movement complete
24. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end select mino 2
25. 0 1 3 2 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end mino movement 1
26. 0 1 3 2 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end mino movement 2
27. 0 1 3 2 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end mino movement complete
28. 0 1 3 2 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end select mino 3
29. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end mino movement 1
30. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end mino movement 2
31. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end mino movement complete
32. 0 1 2 3 ROTATION begin identify central mino evaluate minos: • check rotation path • movement direction • check if occupied end rotation complete
33. 1 ROTATION square radius 1 gives the direction to move next when rotating a mino the center is the central cell in the tetrimino all cells rotate about the central cell as if it were the center of the diagram works clockwise
34. 1 ROTATION square radius 2 gives the direction to move next when rotating a mino the center is the central cell in the tetrimino all cells rotate about the central cell as if it were the center of the diagram works clockwise
35. 1 ROTATION gives the direction to move next when rotating a mino the center is the central cell in the tetrimino all cells rotate about the central cell as if it were the center of the diagram works clockwise movement direction
37. 1 movement direction
38. 1 movement direction
39. 1 movement direction
40. QUESTIONS?
41. EXTERNAL LINKS ▪ http:/ /mdciotti.github.io/tetris/