英和和英

出典:『Wikipedia』 (2010/12/01 06:25 UTC 版)

英語による解説

引用

The pebble motion problems, or pebble motion on graphs, are a set of related problems in graph theory dealing with the movement of multiple objects ('pebbles') from vertex to vertex in a graph with a constraint on the number of pebbles that can occupy a vertex at any time. Pebble motion problems occur in domains such as multi-robot motion planning (in which the pebbles are robots) and network routing (in which the pebbles are packets of data). The best-known example of a pebble motion problem is Sam Loyd's famous 15-puzzle.