proposal done

PROPOSAL_20220899.md

@@ -0,0 +1,101 @@
+- [My proposal](#my-proposal)
+  - [Basic Information](#basic-information)
+  - [Video Game: nag a ram](#video-game-nag-a-ram)
+    - [Game Mechanics](#game-mechanics)
+    - [Technical Implementation](#technical-implementation)
+  - [Use of AI](#use-of-ai)
+
+# My proposal
+
+## Basic Information
+
+- Name: Yu Min Choi
+- ID: 20220899
+- [Repository](https://git.prototyping.id/20220899/homework5)
+
+## Video Game: nag a ram
+
+_**nag a ram**_ is an anagram game that helps English speakers improve problem-solving skills and build vocabulary.
+
+> An anagram is a word or phrase made by using the letters of another word or phrase in a different order. For example, _silent_ and _listen_ are anagrams. _triangle_, _alerting_, _integral_, and _relating_ are all anagrams of one another.
+>
+> \*_nag a ram_ is an anagram of _anagram_.
+
+### Game Mechanics
+
+**How to Play**
+
+1. A base word appears on screen. The player can choose the number of letters beforehand or leave it random.
+2. Drag the letter tiles to rearrange them into a valid anagram before time runs out. The time limit scales with word length — longer words get more time.
+3. Press **Complete** to submit the answer.
+4. If correct, the player earns points and can save the word to a personal vocabulary list for later review.
+5. If incorrect or time runs out, one life is lost. The player has 5 lives per session. Once all lives are spent, there is a 5-minute cooldown before the game can be restarted.
+
+**Constraints**
+
+- Word: Single word only
+- Time: Scales with word length
+- Lives: 5 per session
+
+**Scoring**
+
+- Base points: Awarded per correct answer, scaled by word length
+- Streak bonus: Multiplied by consecutive correct answers
+- Easter egg: Double points for palindrome answers
+
+**Interface**
+
+The letter tiles are designed to resemble wooden blocks, giving the game a tactile, physical feel reminiscent of classic word games like Scrabble.
+
+![pic](assets/scrabble.jpg)
+
+### Technical Implementation
+
+[**Random Word API**](https://random-word-api.herokuapp.com/)
+
+The base word is randomly generated using the Random Word API with a length parameter.
+
+For example,
+https://random-word-api.herokuapp.com/word?length=9 returns:
+
+```json
+["triangle"]
+```
+
+[**Anagramica API**](http://anagramica.com/api)
+
+Once base word fetched from the Random Word API, the Anagramica API is used to verify at least one valid anagram (excluding the base word itself) exists. If the player's submission matches any word in the array, the answer is validated.
+
+For example, http://www.anagramica.com/best/:triangle returns:
+
+```json
+{
+  "best": ["alerting", "altering", "integral", "relating", "triangle"]
+}
+```
+
+**Word module**
+
+- `fetchRandomWord(length)`: Fetches a random word from the Random Word API with the specified or random length
+- `fetchAnagrams(word)`: Fetches valid anagrams from the Anagramica API
+  - Uses `.filter()` to exclude the base word and ensure at least one valid anagram exists
+- `validateAnswer(answer, anagrams)`: Checks if the player's input matches a valid anagram
+  - Uses `.includes()` to search the anagram array
+- `isPalindrome(answer)`: Checks if the given word is a palindrome
+  - Uses recursion to compare letters inward from both ends
+
+**Game class**
+
+Manages state: score, timer, lives, streak
+
+- `addScore(wordLength)`: Calculates and adds points based on word length, applies the streak multiplier, and doubles points if the palindrome check passes
+- `startTimer(wordLength, onTick, onTimeUp)`: Starts a countdown scaled to word length
+- `stopTimer()`: Stops the timer, either when the player submits an answer or when time runs out
+- `deductLife()`: Removes a life and resets the streak
+- `isGameOver()`: Checks if all lives have been used
+
+**Vocabulary class**
+
+## Use of AI
+
+AI was used to paraphrase and refine the written content of this proposal.

PROPOSAL_20240905.md

@@ -1,148 +0,0 @@
-# Untitled Maze Game - ID30011 Midterm Project Proposal
-
-- **Name:** Bumgyu Suh
-- **Student ID:** 20240905
-- **Repository URL:** https://git.prototyping.id/20240905/homework5
-
-## Table of Contents
-1. [Game Description and Mechanics](#game-description-and-mechanics)
-    - [Objective](#objective)
-    - [Core Mechanics](#core-mechanics)
-    - [Win / Lose Conditions](#win--lose-conditions)
-    - [Player Controls](#player-controls)
-2. [Visual Design and Implementation](#visual-design-and-implementation)
-    - [Visual Style](#visual-style)
-    - [Game Elements](#game-elements)
-    - [Implementation](#implementation)
-3. [Challenges and Features](#challenges-and-features)
-    - [Expected Challenges](#expected-challenges)
-    - [Features and Concepts Used](#features-and-concepts-used)
-
-# Game Description and Mechanics
-
-![Ingame Chest](./ingame_chest.png)
-
-**Untitled Maze Game** is planned to be a **3D first-person maze game** made using [Babylon.js](https://www.babylonjs.com/), where the player is attempting to escape from a dungeon. The game is structured in levels. In each level, a **procedurally generated maze** is created, and the player must find the key to the exit in one of the chests in  the level, and the exit to advance to the next level. The twist is, if the player opens a chest that the player has already opened before, the player dies and the game is over. The score is determined by how many levels the player wins, and how fast. The ultimate goal is to get the highest highscore.
-
-## Objective
-- Search through the chests of the level to find the exit key.
-- Avoid opening chests that has already been opened before.
-- Escape the maze by finding the exit with the exit key.
-- Progress through as many levels as possible, as quickly as possible.
-
-## Core Mechanics
-- Each level generates a new maze with increasing size or complexity.
-- The main challenge is **memory-based navigation** and **speed**:
-  - If the player opens a **chest that has already been opened before**, the player dies.
-  - This forces the player to remember previous paths and avoid repeating mistakes.
-  - The player also has an incentive to make decisions quick to complete the level in the shortest amount of time.
-
-## Win / Lose Conditions
-- **Win (per level):** Reach the exit of the maze with the key.
-- **Lose:** Re-open a previously opened chest.
-
-## Player Controls
-- `W/A/S/D` keys for movement
-- Mouse movement to control camera direction
-- Left click with mouse while facing a chest to "open" chest
-  1. When correct chest with key: gives key right away
-  2. When chest without key: shows that it is the wrong chest
-  3. When chest that has already been opened: game over
-- Automatic progression to next level when the "exit area" is reached
-
----
-
-# Visual Design and Implementation
-
-## Visual Style
-
-The game will have a simple 3D dungeon-like appearance, with each wall being as large as the walkable space, similar to a maze built in Minecraft:
-- Dark environment (dungeon setting)
-- Walls forming a maze
-- Minimal lighting to create atmosphere
-- The player is represented through a **first-person camera** (no visible body)
-
-## Game Elements
-
-| Element        | Description                              | Implementation |
-|----------------|------------------------------------------|----------------|
-| Player         | First-Person View (cannot see oneself)   | Camera object |
-| Maze           | Procedurally generated dungeon layout    | 2D array → 3D meshes |
-| Walls          | Maze boundaries                          | Box meshes |
-| Floor          | Ground surface                           | Plane mesh |
-| Exit           | Goal area (highlighted ground)           | Plane mesh highlighted in yellow |
-| Chests         | Special tracked cells                    | Box mesh |
-| UI             | Score (round count), instructions        | Text overlay |
-
----
-
-## Implementation
-
-![Maze Topview](./maze_topview.png)
-![Maze Topview Annotated](./maze_topview_annotated.png)
-
-### Maze Representation
-The maze will be stored as a 2D array that stores ID corresponding to this:
-- 0 = empty path
-- 1 = wall
-- 2 = not-yet opened chest without key
-- 3 = already opened before chest
-- 4 = chest with key
-- 5 = starting point
-- 6 = exit
-
-This grid will be converted into 3D.
-
----
-
-### Procedural Generation
-
-Each level:
-1. Generate a new maze with walls and empty paths (0s and 1s in the array)
-2. Identify dead-end cells, put chests in them
-3. Make one of the chests the chest with the key
-4. Make another "chest" (dead-end) the exit
-5. Randomly place player in empty path position
-
-These steps will be implemented as a sequence of functions using **functional programming**.
-
----
-
-### Maze Array Logic
-
-States that need to be stored are stored in the level array (whether chest has been opened, whether the chest is the chest with the key).
-
-- The game will store opened chests by turning the value in the array to 3.
-- When the player opens a chest marked with 3, the game over screen shows.
-- When the player reaches an "exit" space WITHOUT the key, the player is told to find the key first.
-- When the player reaches an "exit" space WITH the key, the player proceeds to the next level.
-
----
-
-# Challenges and Features
-
-## Expected Challenges
-
-### 1. Procedural Maze Generation
-Generating a valid and solvable maze for every level while keeping it balanced in difficulty.
-
-### 2. Difficulty Scaling
-Designing how the maze size increases over levels without making the game frustrating or too easy. Making the highscore meaningful to incentivize fast gameplay, which turns a boring memorization-based game into something more competitive in order to be fun.
-
-### 3. Player Navigation Experience
-Ensuring that the maze is readable enough for satisfying gameplay without visual confusion.
-
-### 4. Learning to use the Babylon.js
-Learning a completely new thing I have never used before effectively.
-
----
-
-## Features and Concepts Used
-
-The implementation will use the following concepts learned in class:
-
-- **JavaScript arrays** (maze array, chests' state)
-- **Functional programming** (steps involved in maze generation)
-- **Event handling** (keyboard and mouse input)
-- **Using javascript libraries** (using [Babylon.js](https://www.babylonjs.com/))
-- **Working with real-time** (stopwatch system for high score)