top of page

UNITY DEVELOPMENT COURSE

APPLICATION FORM

Click here for course details (curriculum, fees etc.)

Our application process is as follows:

number.png

Fill up the form below with your details so we can reach out to you and guide you through the application process.

Submit Application Form below

number (1).png

Secure Your Slot with $100 Deposit

Make payment of your deposit so we can ensure you get a slot in our class. This amount will be part of your full payment for the course fees and will be reimbursed to you upon approval of your subsidy status.

number (2).png

Await Email Confirmation

After completing the steps before, our Gen Infiniti representative will reach out to you to guide you on how to make full payment, prepare for lessons and make your subsidy claim (if eligible).

Await Email Confirmation

Submit Application Form below

Secure Your Slot with $100 Deposit

Please ensure that all information that you provide below is as accurate as possible. This is to ensure smooth facilitation of your application as well as subsidy approval, if you are eligible.

IMPORTANT: Before submitting your application, please check your eligibility for subsidies under CITREP+ here.

By clicking submit, you agree to our Terms of Service and that you have read our Privacy Policy.

  • INTRODUCTION
    Introduction What is AI good for?
  • GRAPH-SEARCH ALGORITHMS
    Breadth-first search introduction Breadt-first search implementation Depth-first search introduction Depth-first search implementation I - with stack Depth-first search implementation II - with recursion Enhanced search algorithms introduction Iterative deepening depth-first search (IDDFS) A* search introduction
  • BASIC SEARCH & OPTIMIZATION ALGORITHMS
    Brute-force search introduction Brute-force search example Stochastic search introduction Stochastic search example Hill climbing introduction Hill climbing example
  • META-HEURISTIC OPTIMIZATION METHODS
    Heuristics VS meta-heuristics Tabu search introduction Simulated annealing introduction Simulated annealing - function extremum I Simulated annealing - function extremum II Simulated annealing - function extremum III Travelling salesman problem I - city Travelling salesman problem II - tour Travelling salesman problem III - annealing algorithm Travelling salesman problem IV - testing Genetic algorithms introduction - basics Genetic algorithms introduction - chromosomes Genetic algorithms introduction - crossover Genetic algorithms introduction - mutation Genetic algorithms introduction - the algorithm Genetic algorithm implementation I - individual Genetic algorithm implementation II - population Genetic algorithm implementation III - the algorithm Genetic algorithm implementation IV - testing Genetic algorithm implementation V - function optimum Swarm intelligence intoduction Partical swarm optimization introduction I - basics Partical swarm optimization introduction II - the algorithm Particle swarm optimization implementation I - particle Particle swarm optimization implementation II - initialize Particle swarm optimization implementation III - the algorithm Particle swarm optimization implementation IV - testing
  • MINIMAX ALGORITHM - GAME ENGINES
    Game trees introduction Minimax algorithm introduction - basics Minimax algorithm introduction - the algorithm Minimax algorithm introduction - relation with tic-tac-toe Alpha-beta pruning introduction Alpha-beta pruning example Chess problem
  • BUILDING TIC-TAC-TOE
    About the game Cell Constants and Player Game implementation I Game implementation II Board implementation I Board implementationj II - isWinning() Board implementation III Minimax algorithm Running tic-tac-toe
  • INTERVIEW: SINGAPOREAN EXPERT
    Background of Expert Information and Communication Technology in Singapore
bottom of page