Search for Apps

The Hamiltonian Circuit

Try The Hamiltonian Circuit, a fun, relaxing puzzle game that's easy to learn and tough to master. Find a path that visits every square in the grid, avoiding walls and never crossing itself, to create one continuous circuit. There's only one solution for every puzzle. To get the hang of things, st

Quantum Mechanics

✴This app is the best resource for your Quantum Mechanics Study.✴ 【Topics Covered Based On Below Concepts】 *What Is Quantum Mechanics? *Particles of light? *Mathematical Prerequisites *Functions as Vectors *The Dot, oops, INNER Product *Operators *Basic Ideas of Quantum Mechanics *The Heise

KGraphs

KGraphs is an easy way of learning how graphs, relations, and algorithms work together in order to find spanning trees, shortest path, Eulerian circuit/path, Hamiltonian circuit/path, reflexive relations, symmetric relations, transitive relations and much more. KEY FEATURES Undirected Graph: - Und

Hamilton - A One-Stroke Game

Fill all blocks with one stroke. This kind of problems are also known as Hamiltonian path problem in graph theory. There is only one solution to each level.

HamiltonianCycles

This app aims to provide a subject in programming education. The Hamiltonian cycles problem is to find out a paths in a directed graph of n vertices, starting from one starting point, visiting all vertices only once, and returning to the starting point. This is known as NP-complete problem, and gene

Grafos e Ciclos Hamiltonianos

This app solves the hamiltonian cycle problem for a given graph. The problem is to find paths in a directed graph of n vertices, starting from a starting point, visiting all the vertices only once and returning to the starting point. This is known as an NP-complete problem and no efficient solution

Basic Graph Theory and Algorit

A quiz with questions about graph theory and algorithms that I used to study for my Algorithms and Datastructures course. It's made up of basic facts from trees, graph connectivity, eulerian and hamiltonian tours as well as breadth-first-search and depth-first-search questions that test your intuiti

Hamils Cube

It's a challenging puzzle game that combines Hamiltonian's Path probelm with Rubik's Cube mechanism. You will need patience and the ability to think and reasoning in 3D space to solve these puzzles. WARNING: The puzzles require some actual thinking in order to be solve, so this game is NOT FOR EVERY

Hamilton Cycle

Build a Cycle and visit every Node just once! Connect all nodes and find your own way. Improve your chances by using some hints. The Hamiltonian cycle problem exists since years and there has not been found any fast solution to solve it. This game tries to illustrate this problem and will hopefull

Hamiltonian Cycle

Introduction: The Hamiltonian circuit game is a creative and challenging puzzle game designed to test players' logical thinking and spatial planning abilities. In this game, players are presented with a grid-based path diagram. The objective is to connect all the nodes and return to the initial nod

Hamilton

The P versus NP problem is a major unsolved problem in computer science. It discusses whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to ca

NET GATE Physics- Physicspedia

Handwritten notes for CSIR NET PHYSICAL SCIENCE, GATE PHYSICS, TIFR, GRE, and other examinations. Previous year question papers. Syllabus for CSIR NET/JRF physical science and many universities ( M.Sc. Physics ) 1-MATHEMATICAL PHYSICS – Matrix, vector algebra, complex no, tensor analysis, group the