Isibali sekhodi sehashi Eller's Algorithm Maze Generator

I-algorithm ka-Eller iyi-algorithm yokukhiqiza i-maze ekhiqiza ngempumelelo ama-maze aphelele (ama-maze angenazo izihibe kanye nendlela eyodwa phakathi kwamaphuzu amabili) isebenzisa indlela yomugqa nomugqa. Ikhiqiza ama-maze afana ne-algorithm kaKruskal, kodwa yenza lokho ngokukhiqiza umugqa owodwa ngesikhathi, ngaphandle kwesidingo sokugcina yonke i-maze enkumbulweni. Lokho kwenza kube wusizo ekukhiqizeni ama-maze amakhulu kakhulu ezinhlelweni ezilinganiselwe kakhulu kanye nasekukhiqizeni okuqukethwe kwenqubo.

I-maze ephelele i-maze lapho kukhona indlela eyodwa ncamashi ukusuka kunoma iyiphi indawo ku-maze ukuya kunoma iyiphi enye indawo. Lokho kusho ukuthi ngeke ugcine usuzungeza emibuthanweni, kodwa uzohlangana nezinto ezifile, okuphoqa ukuthi ujike uphinde ubuyele emuva.

Amamephu we-maze akhiqizwe lapha afaka inguqulo ezenzakalelayo ngaphandle kwanoma yiziphi izindawo zokuqala nokuqeda, ukuze ukwazi ukuzinqumela lokho: kuzoba nesixazululo kusuka kunoma iyiphi indawo ku-maze kuya kunoma iyiphi enye indawo. Uma ufuna ugqozi, ungavumela indawo yokuqala neyokuqeda ephakanyisiwe - futhi ubone ngisho nesixazululo phakathi kwakho kokubili.

Mayelana ne-Algorithm ka-Eller

I-Algorithm ka-Eller yethulwa nguDavid Eller.

Le algorithm iphawuleka ngendlela yayo ephumelelayo yomugqa nomugqa yokwenza i-maze, okwenza ibe yindawo ekahle kakhulu kuma-maze angenamkhawulo noma ama-maze akhiqizwa ngesikhathi sangempela. Ivame ukucashunwa ekwakhiweni kokuqukethwe kwenqubo kanye nasezincwadini ze-maze-generation, kodwa angikwazanga ukuthola imithombo eyinhloko echaza ukushicilelwa kwayo kokuqala.

Indlela i-Algorithm ka-Eller esebenza ngayo ku-Maze Generation

I-algorithm ka-Eller icubungula umugqa owodwa ngesikhathi, igcina futhi iguqula amasethi amaseli axhunyiwe. Iqinisekisa ukuxhumana ngenkathi igwema izihibe, futhi yelula ngempumelelo i-maze iye phansi.

Ngokwemfundiso ingasetshenziswa ukukhiqiza ama-maze angenamkhawulo, nokho ukuze kuqinisekiswe ukuthi i-maze ekhiqizwe ingaxazululeka ngempela, kuyadingeka ukushintshela ku-logic "yomugqa wokugcina" ngesikhathi esithile ukuze uqedele i-maze.

Isinyathelo 1: Qala Umugqa Wokuqala

• Nika iseli ngalinye emgqeni i-ID yesethi ehlukile.

Isinyathelo 2: Joyina Amanye Amaseli Aseduze Ngokuvundlile

• Hlanganisa amaseli aseduze ngokungahleliwe ngokuwabeka ku-ID efanayo yesethi. Lokhu kuqinisekisa ukuthi kunezindlela ezivundlile.

Isinyathelo 3: Dala Ukuxhumeka Okuqondile Kumugqa Olandelayo

• Kusethi ngayinye evela emgqeni, okungenani iseli elilodwa kumele lixhumeke phansi (ukuqinisekisa ukuxhumana).
• Khetha ngokungahleliwe iseli elilodwa noma ngaphezulu kusuka kusethi ngayinye ukuze uxhumeke emgqeni olandelayo.

Isinyathelo 4: Yiya Emgqeni Olandelayo

• Qhubekisa phambili ukuxhumana okuqondile ngokunikeza i-ID efanayo yesethi kumaseli ahambisanayo ngezansi.
• Nikeza ama-ID amasha esethi kunoma yimaphi amaseli angabelwe.

Isinyathelo 5: Phinda Izinyathelo 2–4 Kuze Kufinyelelwe Umugqa Wokugcina

• Qhubeka ucubungula umugqa ngomugqa.

Isinyathelo 6: Cubungula Umugqa Wokugcina

• Qinisekisa ukuthi wonke amaseli emgqeni wokugcina angowesethi efanayo ngokuhlanganisa noma yimaphi amasethi ahlukene asele.

Ukufunda Okuqhubekayo

Uma ukujabulele lokhu okuthunyelwe, ungaphinda uthande lezi ziphakamiso:

• Kruskal sika Algorithm Maze Generator
• Recursive Backtracker Maze Generator
• Ukukhula Tree Algorithm Maze Generator