Back

GALLERY: N 2 Algorithm

Loading...

This is a computerised version of the old classic which lets you play the game online. The aim is complete more boxes than your opponent. You and your opponent take it in turns to join up two adjacent dots with a line. If any player fills a box they must make another move. You can play 1 or 2 player. But watch out, the computer strategy is driven by a reasonably intelligent algorithm!

  • FFT | Fast Fourier Transform
  • Stacks & Queues EECS: Stacks & Queues Stacks April 23, ppt ...
  • Examples for Algorithm Flowcharts
  • ALGORITHMS - PART 3 REPETITION/LOOP CONTROL STRUCTURE ...
  • performance - In this insertion sort algorithm for example ...
  • Asymptotic notation | Algorithms (article) | Khan Academy
  • Algorithm chapter 2
  • PPT - CS 267 Applications of Parallel Computers Lecture 19 ...
  • computer science - Proving Fibonacci recursive algorithm ...
  • Introduction to artificial intelligence А* Search ...
  • Sorting
  • PARLab Parallel Boot Camp Computational Patterns and ...
  • Introduction to Algorithms
  • asymptotics - algorithm complexity calculation T(n) = 2T(n ...
  • Bayesian Algorithm for Search - Boston Media Domain
  • Hub 102 - Lesson 5 - Algorithm: Sorting & Searching
  • How to format a pseudocode algorithm - TeX - LaTeX Stack ...
  • algorithms - Why is mergesort O(log n)? - Software ...
  • Algorithm chapter 2
  • Chapter 1: INTRODUCTION TO DATA STRUCTURE - ppt video ...
  • Algorithm paradigms
  • Discrete Math and Its Application to Computer Science ...
  • [D2CAMPUS] Algorithm tips - ALGOS
  • Algorithm Design and Complexity - Course 4 - Heaps and ...
  • Big-O notation | {Algorithm;}
  • Design and Analysis of Algorithms
  • Sequencing problem using Johnson’s algorithm of scheduling ...
  • One Dimensional Arrays - ppt video online download