Intro
After a refreshing weekend, I am continuing this journey with Day 6. Improving my skills in JavaScript, Data Structures and algorithms. And for Game design I am continuing with creating a Level design document and read a book about game design. And learning Japanese from Zero! and for revisiting English from lower-intermediate course.
Language
Japanese: Learn and revised all the numbers from 0-1000000000. Used Practice sheet to write (a, i, u, e ,o) (ka, ki ku ke ko) (sa, shi, su, se so)letters. And wrote all series of hiragana letters once.
English: BBC leaning English, Course- lower intermediate
Unit 3, Session 3: like for preference and like for description
Activity 1 What's it like where you live?
Activity 2 Vocabulary practice
Activity 3 Grammar!
Activity 4 Pronunciation tip
Session 4: Activity 1 Mystery object, Activity 2,3,4 related to audio and vocabulary exercises.
Game design
I am reading this book called “The Art of Game Design” by Jesse Schell. Today, I completed a few pages and read about:
Natural Vs Artificial balancing, Elegance means "A game that is simple to learn and understand, but is full of interesting emergent complexity. " and Character(protangist) . Balance type: Detail Vs Imagination: Giving players situations they can easily fantasize about their imagination take wing, and all kinds of imaginary details will quickly crystallize around one little detail that the designer provided. Lens of Elegance, Character and Imagination
LDD: In last week I completed Level overview and today I started with Level Walkthrough, in which i created 2 beats for my current level. Defining What happens, Objective, Locations, Design goal, Progression.
Coding
JavaScript: Worked on project: Ad design, in this project I have a added one product shape and used different types of font and size. For my previous Project: Animal Attack, I am to going create a big fish eating food and when fish eats food his body size and eyes size will increase.
Computer science theory: Intro to Algorithms, Linear, Binary search: Implementing and Running time of binary search. asymptotic notation, three forms of it: big- [ \Theta ] notation, big-O notation, and big- [ \Omega ] notation.