Mathematical Puzzles

Dual Cryptograms

Anagrams Cryptograms Doublets
Logic Puzzles Magic Word Squares Sudoku
Chess Fractal Puzzles Tangrams




Intellectual Puzzles
List of Puzzles
Analytical Puzzles
Christmas Puzzles
New Year's Puzzles
Fractal Puzzles
Easter Puzzles
Nature Fractals
Encrypted Quotations
Fractal Images
Baseball Puzzles
Daily Fractal Puzzle
Math Recreations
Algebra Placement
Cryptogram Challenge
Tangram Stories
Puzzle Categories
Thanksgiving Quotes
Christmas Quotes
Christmas Logic
New Year Resolutions
Advertise With Us



Previous Topic

Next Topic


The Chinese Postman Problem is an example of a problem in discrete mathematics and graph theory.  The problem is thought to have originated from an old Chinese puzzle involving a postman.  In this puzzle, a postman has to go through many streets to deliver letters and wishes to do it in the shortest distance possible.

In mathematical language, it is a problem in graph theory which seeks to find the minimum length closed walk that traverses each edge at least once. Finding an optimal solution in a graph with both directed and undirected edges is NP-complete.

The Chinese Postman Problem may also got its name because it was proposed by Mei-Ko Kwan, a Chinese mathematician, in 1962.  An alternative and more modern name is “Route Inspection Problem”.

More Mathematical Recreations

Previous Topic

Next Topic


Custom Search

MX iTunes, App Store, iBookstore, and Mac App Store


Hosted By Web Hosting by PowWeb

© 2000-2013 Logicville