Demonstration of a problem-solving method
A program for backtrack seeking is proved here by using deduction rules. The problem of whether a chessboard can be moved over by the knight stepping on every square once and only once, is studied, and is traced back to the theorem of backtrack seeking in two ways. A comparison is made between the p...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1995
|
| Sorozat: | Acta cybernetica
12 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12543 |
| LEADER | 01171nab a2200253 i 4500 | ||
|---|---|---|---|
| 001 | acta12543 | ||
| 005 | 20220613133833.0 | ||
| 008 | 161015s1995 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 2 | |a Nyéky-Gaizler Judit | |
| 245 | 1 | 0 | |a Demonstration of a problem-solving method |h [elektronikus dokumentum] / |c Nyéky-Gaizler Judit |
| 260 | |c 1995 | ||
| 300 | |a 71-82 | ||
| 490 | 0 | |a Acta cybernetica |v 12 No. 1 | |
| 520 | 3 | |a A program for backtrack seeking is proved here by using deduction rules. The problem of whether a chessboard can be moved over by the knight stepping on every square once and only once, is studied, and is traced back to the theorem of backtrack seeking in two ways. A comparison is made between the programs obtained. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Fóthi Ákos |e aut |
| 700 | 0 | 2 | |a Konczné-Nagy Márta |e aut |
| 700 | 0 | 2 | |a Harangozó Éva |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12543/1/cybernetica_012_numb_001_071-082.pdf |z Dokumentum-elérés |