| |
| |
|
 | Hello frank,
sry that I it so hard formulate but if I such paths sustain...
...can I nothing other More say! I Have really whom local the The function with a zufallsgenerator operates!
How You Perhaps already Pinned have program I straight one small game in profane with your dll,therefore write I here so plenty
I Have yet solely voller strain on this momentum hinprogrammiert in the The sprites itself the first time autonomously by the background moving, umso larger was my disillusionment as i the first ergebnisse saw...
in 50% all fälle is the track completely hirnrissig,one has Real whom local The sprites wären drunk and torkeln on the target past!
in further 25% becomes garkein way found though of/ one there's and the pixelbreite the weges already on 1 is...
The restlichen 25% percent wären Perhaps yet acceptable,are but immernoch far of ideal removes.
without these (vernüftig working) function is my game unfortunately to that failure doomed! yourself program can something like neither there getpixel zulangsam operates! |
|
| |
| |
| |
|
|
| Hi,
sry that I it so hard formulate but if I such paths sustain...
...can I nothing other More say! I Have really whom local the The function with a zufallsgenerator operates!
naturally is a small Quäntchen chance with in the game...
your both Examples kranken but on it, the at all no lane found go must, because it nirgendwo verspeert is...
For this is FindPath neither ausgelegt. The function operates always rather, apiece worse the direct lane verstellt is.
work many walls one, then merkst You it.
Nochmal To your Examples: in the Wegsuche demonstration have I hereon waived, first of all whom direct lane to search, Why one demonstration unnecessary tricky make ?
How You Perhaps already Pinned have program I straight one small game in profane with your dll,therefore write I here so plenty
I Have yet solely voller strain on this momentum hinprogrammiert in the The sprites itself the first time autonomously by the background moving, umso larger was my disillusionment as i the first ergebnisse saw...
in 50% all fälle is the track completely hirnrissig,one has Real whom local The sprites wären drunk and torkeln on the target past!
in further 25% becomes garkein way found though of/ one there's and the pixelbreite the weges already on 1 is...
The restlichen 25% percent wären Perhaps yet acceptable,are but immernoch far of ideal removes.
without these (vernüftig working) function is my game unfortunately to that failure doomed! yourself program can something like neither there getpixel zulangsam operates!
statement from the guide:
Sinnvolle values for W weg of 6 To 48. values of 1-5 are To small...
Nimm the value 12.
a couple hints of me:
- if You a solid scenary together with Sprites uses, then use rather MoveSpriteWithTable(), Related The Ballersprite Demos
- building Zusatzwände into mask one, The the User Yes not sees, The the Sprite but moreover join can, a optimalen lane to search
- machine The Pathdaten with SmoothPath(path#,anzahl&,4), the eliminating the Torkeln.
so, yet what.
an FindPath function isn't simply To release, too can tappt im dunkeln not any situations applied go.
The Schwachpunkt of FindPath() are the doing large Flächen without walls. in your drop would I first try directly to that Zielpunkt To gelangen.
If not went (You can Yes inquire, whether the Sprite not any more moving and the Zielpunkt already access has) launch You FindPath().
I hope, the helps already something.
Greeting, Frank |
|
| |
| |
| |
|
|
| habs again in detail with hindernissen tested, Result sees not very much better from...
The last 2 examples demonstrating The problematik of findpath integrally well.
The function attempts first on of/ one axis on The höhe To come and then itself on the others axis the target To approach.
of direktweg is there no track To see!
how'bout if You as orentierung always whom direktweg take and attempt always on this lane To stay or. again to there To come if the lane versperrt is?
would circa some rather his as To try over The achsen to that target To come.. |
|
| |
| |
| |
|
|
| Hi,
The last 2 examples demonstrating The problematik of findpath integrally well.
The function attempts first on of/ one axis on The höhe To come and then itself on the others axis the target To approach.
wrong vermutet !
The function divides The graphic into einfarbiges Mosaikbild on, apiece larger the worth in W, apiece grober the Mosaik...
within this Bilds becomes through one Füllmechanismus (Wave-Marble) attempts, to that target To gelangen, where each Station the Füllens in a scheduler vermerkt becomes.
watts one lane found, then becomes these scheduler optimiert, because creep (means spots) The twice go through get, removes go. this halboptimierte Path is the, whom FindPath() accounts.
circa now whom KÜRZESTEN lane to find, should I ausgehend of all Points the scheduler among themselves a Linienberechnung (Bresenham z.B.) manage (means directly to that target walk).
then had I objectively always whom kürzestzen lane found, but utterly on cost the speed. time foreseen of hoisted.
the would even in Assembler whom welt sprengen 
Vielleich make I this amendment Yes time with of/ one option available. momentarily but well not.
of direktweg is there no track To see!
Have I Yes never behauptet. the müßtest You in your Program hold first try, directly to that target To gelangen. If not works, can You then FindPath walk.
Greeting, Frank |
|
| |
| |
| |
|
|
| ok,saw so from as though You it so made would have.
would me Yes evtl.too yet self what basteln but with getpixel can Yes not works so slow How this is.
can there evtl.with a aray the faster inquire?
would me forward if You The function still improve would,because in the jetzigen status is Yes quasi unbracuhbar... |
|
| |
| |
| |
|
|
| Hi,
beschreib your idea still time hither, what very want thou make?
Meinst You not, you are with solid Pfaden rather bedient ?
Greeting, Frank |
|
| |
| |
| |
|
|
| moin,
Search really only a substitute for getpixel!
then can I me self what program(hopefully). somehow have you got it already faster hingekriegt because with backgroundcollision ask You indeed one bitmap-aray ex.
it reicht completely if The function only 0 or 1 zurückgibt! |
|
| |
| |
| |
|
|
| Hi,
No, there becomes objectively GetPixel() uses...
Nimm The API Version, is faster as Profans GetPixel.
but mean me, a FindPath-function To make is everything else as simply... but probiers hold.
Greeting, Frank |
|
| |
| |
| |
|
|
| I wished Yes garkeine findpath function make(god bewahre),separate it quasi on-the-way inquire:
the image moving itself on direktem lane to zielposition,if it now one hinderniss meets entscheide I where long the image weg should: supra/under-left/right
with backgroundcollision there Yes only The possibility the image rebound To let and not if possible past walk to permit.
but how'bout here with a new flag? if the flag staid is becomes automatically with findpath one lane around the hinderniss around sought(might then Yes really not such unsinnigen paths produce,or?). it should means only the point(the on the breseham linieliegt) directly hinterdem hinderniss angesteuert go... |
|
| |
| |
| |
|
|
| Hi,
nice idea. but circa this point To discern, müßten nevertheless all kinds of direct ways be checked
well, i'll soon again try FindPath() moreover To optimize.
Greeting, Frank |
|
| |
| |
| |
|
(550)
Deutsch
English
Français
Español
Italia