https://github.com/estherslabbert/odin-tic-tac-toe
The Odin Project: Tic Tac Toe project
https://github.com/estherslabbert/odin-tic-tac-toe
css html html-css-javascript javascript odin-project tic-tac-toe
Last synced: 3 months ago
JSON representation
The Odin Project: Tic Tac Toe project
- Host: GitHub
- URL: https://github.com/estherslabbert/odin-tic-tac-toe
- Owner: EstherSlabbert
- Created: 2024-02-14T16:23:17.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-02-21T22:04:52.000Z (over 2 years ago)
- Last Synced: 2025-04-06T00:17:46.080Z (over 1 year ago)
- Topics: css, html, html-css-javascript, javascript, odin-project, tic-tac-toe
- Language: JavaScript
- Homepage: https://estherslabbert.github.io/odin-tic-tac-toe/
- Size: 8.79 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# The Odin Project: Tic Tac Toe
This is my solution to the Odin Project's Tic Tac Toe project, the specifications of which can be found [here](https://www.theodinproject.com/lessons/node-path-javascript-tic-tac-toe).
This project focuses on using **factories** (factory functions) and **IIFE** (Immediately Invoked Function Expression) to limit global code. It also uses the concept of **closures** in JavaScript, which is a technique for organizing code providing a way to create private functions and variables that are not accessible from the global scope. This can help to manage the global namespace and prevent naming conflicts.
Conditions for winning or ending the game:
1. To win all markers in a row should be = (e.g. indices for nested array: `[0][0] == [0][1] == [0][2]`).
2. To win all markers in a column should be = (e.g. indices for nested array: `[0][0] == [1][0] == [2][0]`).
3. To win diagonal markers shoud be = (e.g. indices for nested array: `[0][0] == [1][1] == [2][2] || [0][2] == [1][1] == [2][0]`).
4. If none of the above conditions are met and the entire board is filled, then there is no winner. The game is a tie.
## Additional info
**Closures** can also be used to create modules, which can encapsulate related functionality and make it available through a public interface. This can make the code more modular, reusable, and easier to understand. Additionally, closures provide a way to create functions that maintain access to their original context even after the outer function has returned, which can be useful for creating functions that need to access and manipulate data from their enclosing scope.