Description: Gold array problem m* n (m ≤ 100, n ≤ 100) gold coins on the table arranged in a m-n array of gold coins. Each gold coin or face up or back up. Gold status with the digits, 0 gold side up, 1 back up. Gold arrays rules of the game are: (1) gold coins each time to turn over any line on the original location (2) choice of two each time, switching the location of these two gold coins. Gold array given initial state and target state, programming calculation rules of the game by gold, the gold transform the array to the target from the initial state the minimum required to change the number of states.
To Search:
- [GoldCoinArray] - Data Structures and Algorithms GoldCoinA
- [goldIssuse] - Algorithm design in gold on the issue of
- [algorithm] - Eight Queens problem, gold array of issu
File list (Check if you may need any files):
jinbi\jinbi.dsw
.....\jinbi.ncb
.....\Debug\vc60.idb
.....\.....\vc60.pdb
.....\.....\jinbi.pch
.....\.....\jinbi.exe
.....\.....\jinbi.pdb
.....\.....\jinbi.obj
.....\.....\jinbi.ilk
.....\jinbi.plg
.....\jinbi.cpp
.....\jinbi.dsp
.....\jinbi.opt
.....\Debug
jinbi
Download