‫ﻣﺘﺮﺟﻢ ﻣﻦ ﺍﻹﻧﺠﻠﻴﺰﻳﺔ ﺇﻟﻰ ﺍﻟﻌﺮﺑﻴﺔ ‪www.onlinedoctranslator.

com -‬‬

‫ﻗﺴﻢﻋﻠﻮﻡ ﺍﻟﺤﺎﺳﺐ‬ ‫ﺩﻭﺭﺓﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪(CS 302‬‬

‫ﺃﺳﺎﻟﻴﺐﻭﺍﺳﺘﺮﺍﺗﻴﺠﻴﺎﺕ ﺍﻟﺒﺤﺚ ﺍﻟﺬﻛﻲ‬

‫ﺍﻟﺒﺤﺚﻣﺘﺄﺻﻞ ﻓﻲ ﻣﺸﻜﻠﺔ ﻭﺃﺳﺎﻟﻴﺐ ﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪ .(AI‬ﻭﺫﻟﻚ ﻷﻥ ﻣﺸﺎﻛﻞ ﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ ﻣﻌﻘﺪﺓ‬
‫ﻓﻲﺟﻮﻫﺮﻫﺎ‪ .‬ﺇﻥ ﺍﻟﺠﻬﻮﺩ ﺍﻟﻤﺒﺬﻭﻟﺔ ﻟﺤﻞ ﻣﺸﺎﻛﻞ ﺃﺟﻬﺰﺓ ﺍﻟﻜﻤﺒﻴﻮﺗﺮ ﺍﻟﺘﻲ ﻳﻤﻜﻦ ﻟﻺﻧﺴﺎﻥ ﺑﺸﻜﻞ ﺭﻭﺗﻴﻨﻲ ﺃﻥ ﻳﻜﺘﺴﺐ ﻓﻴﻬﺎ‬
‫ﺍﻟﻘﺪﺭﺍﺕﺍﻟﻤﻌﺮﻓﻴﺔ ﻭﺍﻟﺘﻌﺮﻑ ﻋﻠﻰ ﺍﻷﻧﻤﺎﻁ ﻭﺍﻹﺩﺭﺍﻙ ﻭﺍﻟﺨﺒﺮﺓ‪ ،‬ﻳﺠﺐ ﺃﻥ ﺗﺘﺤﻮﻝ ﺩﺍﺉﻤﺎً ﺇﻟﻰ ﺍﻋﺘﺒﺎﺭﺍﺕ ﺍﻟﺒﺤﺚ‪ .‬ﺗﻨﺪﺭﺝ ﺟﻤﻴﻊ‬
‫ﻃﺮﻕﺍﻟﺒﺤﺚ ﺑﺸﻜﻞ ﺃﺳﺎﺳﻲ ﺿﻤﻦ ﺇﺣﺪﻯ ﻓﺉﺘﻴﻦ‪ ،‬ﺍﻟﻄﺮﻕ ﺍﻟﺸﺎﻣﻠﺔ )ﺍﻟﻌﻤﻴﺎء( ﻭﺍﻷﺳﺎﻟﻴﺐ ﺍﻹﺭﺷﺎﺩﻳﺔ ﺃﻭ ﺍﻟﻤﺴﺘﻨﻴﺮﺓ‪.‬‬

‫ﺑﺤﺚﻣﺴﺎﺣﺔ ﺍﻟﺪﻭﻟﺔ‬
‫ﺍﻟﺒﺤﺚﻓﻲ ﻣﺴﺎﺣﺔ ﺍﻟﺤﺎﻟﺔ ﻋﺒﺎﺭﺓ ﻋﻦ ﻣﺠﻤﻮﻋﺔ ﻣﻦ ﺍﻟﺤﺎﻻﺕ ﺍﻟﻤﺘﻌﺪﺩﺓ ﻣﻊ ﻭﺟﻮﺩ ﺍﺗﺼﺎﻻﺕ )ﺭﻭﺍﺑﻂ( ﻣﻨﺎﺳﺒﺔ ﻓﻴﻤﺎ‬
‫ﺑﻴﻨﻬﺎ‪.‬ﻳﻤﻜﻦ ﺗﻤﺜﻴﻞ ﺃﻱ ﻣﺸﻜﻠﺔ ﻋﻠﻰ ﺃﻧﻬﺎ ﺑﺤﺚ ﻓﻀﺎﺉﻲ ﻟﻴﺘﻢ ﺣﻠﻬﺎ ﻣﻦ ﺧﻼﻝ ﺗﻄﺒﻴﻖ ﺑﻌﺾ ﺍﻟﻘﻮﺍﻋﺪ ﻣﻊ ﺍﻹﺳﺘﺮﺍﺗﻴﺠﻴﺔ‬
‫ﺍﻟﻔﻨﻴﺔﻭﻓﻖ ﺧﻮﺍﺭﺯﻣﻴﺔ ﺑﺤﺚ ﺫﻛﻴﺔ ﻣﻨﺎﺳﺒﺔ‪.‬‬
‫ﻣﺎﻗﻠﻨﺎﻩ ﻟﻠﺘﻮ‪ ،‬ﻣﻦ ﺃﺟﻞ ﺗﻘﺪﻳﻢ ﻭﺻﻒ ﺭﺳﻤﻲ ﻟﻠﻤﺸﻜﻠﺔ‪ ،‬ﻳﺠﺐ ﻋﻠﻴﻨﺎ ﺍﻟﻘﻴﺎﻡ ﺑﻤﺎ ﻳﻠﻲ‪:‬‬

‫‪.1‬ﺣﺪﺩ ﻣﺴﺎﺣﺔ ﺍﻟﺤﺎﻟﺔ ﺍﻟﺘﻲ ﺗﺤﺘﻮﻱ ﻋﻠﻰ ﺟﻤﻴﻊ ﺍﻟﺘﻜﻮﻳﻨﺎﺕ ﺍﻟﻤﻤﻜﻨﺔ ﻟﻠﻜﺎﺉﻨﺎﺕ ﺫﺍﺕ ﺍﻟﺼﻠﺔ‬
‫)ﻭﺭﺑﻤﺎ ﺑﻌﺾ ﺍﻟﻤﺴﺘﺤﻴﻼﺕ(‪ .‬ﻣﻦ ﺍﻟﻤﻤﻜﻦ ﺑﺎﻟﻄﺒﻊ ﺗﻌﺮﻳﻒ ﻫﺬﺍ ﺍﻟﻔﻀﺎء ﺩﻭﻥ ﺗﻌﺪﺍﺩ ﺟﻤﻴﻊ ﺍﻟﺤﺎﻻﺕ ﺍﻟﺘﻲ ﻳﺤﺘﻮﻱ‬
‫ﻋﻠﻴﻬﺎﺑﺸﻜﻞ ﺻﺮﻳﺢ‪.‬‬
‫‪.2‬ﺣﺪﺩ ﺣﺎﻟﺔ ﻭﺍﺣﺪﺓ ﺃﻭ ﺃﻛﺜﺮ ﺿﻤﻦ ﺗﻠﻚ ﺍﻟﻤﺴﺎﺣﺔ ﺍﻟﺘﻲ ﺗﺼﻒ ﺍﻟﻤﻮﺍﻗﻒ ﺍﻟﻤﺤﺘﻤﻠﺔ ﺍﻟﺘﻲ ﻗﺪ ﺗﺒﺪﺃ ﻣﻨﻬﺎ ﻋﻤﻠﻴﺔ ﺣﻞ‬
‫ﺍﻟﻤﺸﻜﻠﺔ‪.‬ﻭﺗﺴﻤﻰ ﻫﺬﻩ ﺍﻟﺤﺎﻻﺕ ﺍﻟﺤﺎﻻﺕ ﺍﻷﻭﻟﻴﺔ‪.‬‬
‫‪.3‬ﺣﺪﺩ ﺣﺎﻟﺔ ﻭﺍﺣﺪﺓ ﺃﻭ ﺃﻛﺜﺮ ﺗﻜﻮﻥ ﻣﻘﺒﻮﻟﺔ ﻛﺤﻠﻮﻝ ﻟﻠﻤﺸﻜﻠﺔ‪ .‬ﻭﺗﺴﻤﻰ ﻫﺬﻩ ﺍﻟﺤﺎﻻﺕ ﺣﺎﻻﺕ ﺍﻟﻬﺪﻑ‪.‬‬

‫‪.4‬ﺣﺪﺩ ﻣﺠﻤﻮﻋﺔ ﻣﻦ ﺍﻟﻘﻮﺍﻋﺪ ﺍﻟﺘﻲ ﺗﺼﻒ ﺍﻹﺟﺮﺍءﺍﺕ )ﺍﻟﻌﻮﺍﻣﻞ( ﺍﻟﻤﺘﺎﺣﺔ‪ .‬ﻭﺳﻴﺘﻄﻠﺐ ﺍﻟﻘﻴﺎﻡ ﺑﺬﻟﻚ ﺍﻟﺘﻔﻜﻴﺮ ﻓﻲ‬
‫ﺍﻟﻤﺴﺎﺉﻞﺍﻟﺘﺎﻟﻴﺔ‪:‬‬
‫• ﻣﺎﻫﻲ ﺍﻻﻓﺘﺮﺍﺿﺎﺕ ﻏﻴﺮ ﺍﻟﻤﻌﻠﻨﺔ ﺍﻟﻤﻮﺟﻮﺩﺓ ﻓﻲ ﻭﺻﻒ ﺍﻟﻤﺸﻜﻠﺔ ﻏﻴﺮ ﺍﻟﺮﺳﻤﻴﺔ؟‬
‫• ﺇﻟﻰﺃﻱ ﻣﺪﻯ ﻳﺠﺐ ﺃﻥ ﺗﻜﻮﻥ ﺍﻟﻘﻮﺍﻋﺪ ﻋﺎﻣﺔ؟‬
‫• ﻣﺎﻣﻘﺪﺍﺭ ﺍﻟﻌﻤﻞ ﺍﻟﻤﻄﻠﻮﺏ ﻟﺤﻞ ﺍﻟﻤﺸﻜﻠﺔ ﺍﻟﺬﻱ ﻳﺠﺐ ﺣﺴﺎﺑﻪ ﻣﺴﺒﻘﺎً ﻭﺗﻤﺜﻴﻠﻪ ﻓﻲ ﺍﻟﻘﻮﺍﻋﺪ؟‬

‫ﻭﻳﻤﻜﻦﺑﻌﺪ ﺫﻟﻚ ﺣﻞ ﺍﻟﻤﺸﻜﻠﺔ ﺑﺎﺳﺘﺨﺪﺍﻡ ﺍﻟﻘﻮﺍﻋﺪ‪ ،‬ﺑﺎﻻﺷﺘﺮﺍﻙ ﻣﻊ ﺍﺳﺘﺮﺍﺗﻴﺠﻴﺔ ﺍﻟﺘﺤﻜﻢ ﺍﻟﻤﻨﺎﺳﺒﺔ‪ ،‬ﻟﻠﺘﺤﺮﻙ ﻋﺒﺮ‬
‫ﻣﺴﺎﺣﺔﺍﻟﻤﺸﻜﻠﺔ ﺣﺘﻰ ﻳﺘﻢ ﺍﻟﻌﺜﻮﺭ ﻋﻠﻰ ﻣﺴﺎﺭ ﻣﻦ ﺍﻟﺤﺎﻟﺔ ﺍﻷﻭﻟﻴﺔ ﺇﻟﻰ ﺣﺎﻟﺔ ﺍﻟﻬﺪﻑ‪ .‬ﻭﺑﺎﻟﺘﺎﻟﻲ ﻓﺈﻥ ﻋﻤﻠﻴﺔ ﺍﻟﺒﺤﺚ ﺃﺳﺎﺳﻴﺔ‬
‫ﻟﻌﻤﻠﻴﺔﺣﻞ ﺍﻟﻤﺸﻜﻼﺕ‪ .‬ﻭﻣﻊ ﺫﻟﻚ‪ ،‬ﻓﺈﻥ ﺣﻘﻴﻘﺔ ﺃﻥ ﺍﻟﺒﺤﺚ ﻳﻮﻓﺮ ﺍﻷﺳﺎﺱ ﻟﻌﻤﻠﻴﺔ ﺣﻞ ﺍﻟﻤﺸﻜﻼﺕ ﻻ ﺗﻌﻨﻲ ﺃﻧﻪ ﻻ ﻳﻤﻜﻦ‬
‫ﺃﻳﻀﺎًﺍﺳﺘﻐﻼﻝ ﺍﻷﺳﺎﻟﻴﺐ ﺍﻷﺧﺮﻯ ﺍﻷﻛﺜﺮ ﻣﺒﺎﺷﺮﺓ‪ .‬ﻛﻠﻤﺎ ﺃﻣﻜﻦ‪ ،‬ﻳﻤﻜﻦ ﺗﻀﻤﻴﻨﻬﺎ ﻛﺨﻄﻮﺍﺕ ﻓﻲ ﺍﻟﺒﺤﺚ ﻋﻦ ﻃﺮﻳﻖ ﺗﺸﻔﻴﺮ‬
‫ﺗﻠﻚﺍﻟﻘﻮﺍﻋﺪ‪ .‬ﺑﺎﻟﻄﺒﻊ ﻟﻠﻤﻌﻘﺪﺓ‬

‫ﺻﻔﺤﺔ‪1‬ﻝ‪9‬‬
 ‫ﻗﺴﻢﻋﻠﻮﻡ ﺍﻟﺤﺎﺳﺐ‬ ‫ﺩﻭﺭﺓﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪(CS 302‬‬

‫ﺍﻟﻤﺸﺎﻛﻞ‪،‬ﺳﺘﻜﻮﻥ ﻫﻨﺎﻙ ﺣﺎﺟﺔ ﺇﻟﻰ ﺣﺴﺎﺑﺎﺕ ﺃﻛﺜﺮ ﺗﻌﻘﻴﺪﺍ‪ .‬ﺍﻟﺒﺤﺚ ﻋﺒﺎﺭﺓ ﻋﻦ ﺁﻟﻴﺔ ﻋﺎﻣﺔ ﻳﻤﻜﻦ ﺍﺳﺘﺨﺪﺍﻣﻬﺎ ﻋﻨﺪﻣﺎ ﻻ ﺗﻜﻮﻥ‬
‫ﻫﻨﺎﻙﻃﺮﻕ ﻣﺒﺎﺷﺮﺓ ﻣﻌﺮﻭﻓﺔ‪ .‬ﻭﻓﻲ ﺍﻟﻮﻗﺖ ﻧﻔﺴﻪ‪ ،‬ﻓﺈﻧﻪ ﻳﻮﻓﺮ ﺍﻹﻃﺎﺭ ﺍﻟﺬﻱ ﻳﻤﻜﻦ ﺗﻀﻤﻴﻦ ﺍﻟﻤﺰﻳﺪ ﻣﻦ ﺍﻷﺳﺎﻟﻴﺐ ﺍﻟﻤﺒﺎﺷﺮﺓ‬
‫ﻟﺤﻞﺍﻷﺟﺰﺍء ﺍﻟﻔﺮﻋﻴﺔ ﻣﻦ ﺍﻟﻤﺸﻜﻠﺔ‪ .‬ﻟﺘﺼﻤﻴﻢ ﺧﻮﺍﺭﺯﻣﻴﺎﺕ ﺍﻟﺒﺤﺚ ﻭﺗﻨﻔﻴﺬﻫﺎ ﺑﻨﺠﺎﺡ‪ ،‬ﻳﺠﺐ ﺃﻥ ﻳﻜﻮﻥ ﺍﻟﻤﺒﺮﻣﺞ ﻗﺎﺩﺭﺍً ﻋﻠﻰ‬
‫ﺗﺤﻠﻴﻞﺳﻠﻮﻛﻬﺎ ﻭﺍﻟﺘﻨﺒﺆ ﺑﻬﺎ‪ .‬ﺍﻷﺳﺉﻠﺔ ﺍﻟﺘﻲ ﺗﺤﺘﺎﺝ ﺇﻟﻰ ﺇﺟﺎﺑﺔ ﺗﺸﻤﻞ‪:‬‬

‫• ﻫﻞ ﻳﻀﻤﻦ ﺣﻞ ﺍﻟﻤﺸﻜﻠﺔ ﺇﻳﺠﺎﺩ ﺍﻟﺤﻞ؟‬

‫• ﻫﻞ ﺳﻴﻨﺘﻬﻲ ﺣﻞ ﺍﻟﻤﺸﻜﻠﺔ ﺩﺍﺉﻤﺎً‪ ،‬ﺃﻡ ﻳﻤﻜﻦ ﺃﻥ ﻳﺼﺒﺢ ﻋﺎﻟﻘﺎً ﻓﻲ ﺣﻠﻘﺔ ﻻ ﻧﻬﺎﻳﺔ ﻟﻬﺎ؟‬

‫• ﻋﻨﺪﻣﺎ ﻳﺘﻢ ﺍﻟﻌﺜﻮﺭ ﻋﻠﻰ ﺣﻞ‪ ،‬ﻫﻞ ﻣﻦ ﺍﻟﻤﻀﻤﻮﻥ ﺃﻥ ﻳﻜﻮﻥ ﺍﻟﺤﻞ ﺍﻷﻣﺜﻞ؟‬
‫• ﻣﺎ ﻣﺪﻯ ﺗﻌﻘﻴﺪ ﻋﻤﻠﻴﺔ ﺍﻟﺒﺤﺚ ﻣﻦ ﺣﻴﺚ ﺍﺳﺘﺨﺪﺍﻡ ﺍﻟﻮﻗﺖ ﺃﻭ ﺍﺳﺘﺨﺪﺍﻡ ﺍﻟﺬﺍﻛﺮﺓ‪ ،‬ﺍﻟﺦ‪...‬؟‬

‫• ﻛﻴﻒ ﻳﻤﻜﻦ ﻟﻠﻤﺘﺮﺟﻢ ﺍﻟﻔﻮﺭﻱ ﺗﻘﻠﻴﻞ ﺗﻌﻘﻴﺪ ﺍﻟﺒﺤﺚ ﺑﺸﻜﻞ ﺃﻛﺜﺮ ﻓﻌﺎﻟﻴﺔ؟‬
‫• ﻛﻴﻒ ﻳﻤﻜﻦ ﺗﺼﻤﻴﻢ ﺍﻟﻤﺘﺮﺟﻢ ﻟﻴﺴﺘﺨﺪﻡ ﻟﻐﺔ ﺍﻟﺘﻤﺜﻴﻞ ﺑﺄﻛﺒﺮ ﻗﺪﺭ ﻣﻦ ﺍﻟﻔﻌﺎﻟﻴﺔ؟‬

‫ﻟﻠﺤﺼﻮﻝﻋﻠﻰ ﺇﺟﺎﺑﺔ ﻣﻨﺎﺳﺒﺔ ﻟﻬﺬﻩ ﺍﻷﺳﺉﻠﺔ‪ ،‬ﻳﻤﻜﻦ ﺗﻘﺴﻴﻢ ﺍﻟﺒﺤﺚ ﺇﻟﻰ ﺛﻼﺛﺔ ﺃﺟﺰﺍء‪ .‬ﻳﻘﺪﻡ ﺍﻟﺠﺰء ﺍﻷﻭﻝ ﻣﺠﻤﻮﻋﺔ‬
‫ﻣﻦﺍﻟﺘﻌﺮﻳﻔﺎﺕ ﻭﺍﻟﻤﻔﺎﻫﻴﻢ ﺍﻟﺘﻲ ﺗﻀﻊ ﺃﺳﺲ ﺇﺟﺮﺍء ﺍﻟﺒﺤﺚ ﺍﻟﺬﻱ ﻳﺘﻢ ﻣﻦ ﺧﻼﻟﻪ ﺗﻌﻴﻴﻦ ﺍﻻﺳﺘﻘﺮﺍء‪ .‬ﻭﻳﻌﺮﺽ ﺍﻟﺠﺰء ﺍﻟﺜﺎﻧﻲ‬
‫ﻣﻨﺎﻫﺞﺑﺪﻳﻠﺔ ﺗﻢ ﺍﺗﺒﺎﻋﻬﺎ ﻓﻲ ﺍﻻﺳﺘﻘﺮﺍء ﻛﺈﺟﺮﺍء ﺑﺤﺚ‪ ،‬ﻭﺃﺧﻴﺮﺍً ﻳﻘﺪﻡ ﺍﻟﺠﺰء ﺍﻟﺜﺎﻟﺚ ﻣﺴﺎﺣﺔ ﺍﻹﺻﺪﺍﺭ ﻛﻤﻨﻬﺠﻴﺔ ﻋﺎﻣﺔ ﻟﺘﻨﻔﻴﺬ‬
‫ﺍﻻﺳﺘﻘﺮﺍءﻛﺈﺟﺮﺍء ﺑﺤﺚ‪ .‬ﺇﺫﺍ ﻛﺎﻥ ﺇﺟﺮﺍء ﺍﻟﺒﺤﺚ ﻳﺤﺘﻮﻱ ﻋﻠﻰ ﻣﺒﺎﺩﺉ ﺃﺟﺰﺍء ﺍﻟﻤﺘﻄﻠﺒﺎﺕ ﺍﻟﺜﻼﺛﺔ ﺍﻟﻤﺬﻛﻮﺭﺓ ﺃﻋﻼﻩ‪ ،‬ﻓﻴﻤﻜﻦ ﺃﻥ‬
‫ﺗﻮﻓﺮﺧﻮﺍﺭﺯﻣﻴﺔ ﺍﻟﺒﺤﺚ ﺿﻤﺎﻧﺎً ﻟﻠﺤﺼﻮﻝ ﻋﻠﻰ ﺍﻟﺤﻞ ﺍﻷﻣﺜﻞ ﻟﻠﻤﺸﻜﻠﺔ ﺍﻟﺤﺎﻟﻴﺔ‪.‬‬

‫ﺍﻷﺳﺎﻟﻴﺐﺍﻟﻌﺎﻣﺔ ﻟﺤﻞ ﺍﻟﻤﺸﻜﻼﺕ‬

‫ﻳﻮﺟﺪﻋﺪﺩ ﻛﺒﻴﺮ ﺟﺪﺍً ﻣﻦ ﺗﻘﻨﻴﺎﺕ ﺣﻞ ﺍﻟﻤﺸﻜﻼﺕ ﻓﻲ ﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ ﺍﻟﺘﻲ ﺗﻌﺘﻤﺪ ﻋﻠﻰ ﺍﻟﺒﺤﺚ‪ .‬ﺃﺑﺴﻄﻬﺎ ﻫﻲ‬
‫ﻃﺮﻳﻘﺔﺍﻟﺘﻮﻟﻴﺪ ﻭﺍﻻﺧﺘﺒﺎﺭ‪ .‬ﻳﻤﻜﻦ ﺗﻮﺿﻴﺢ ﺧﻮﺍﺭﺯﻣﻴﺔ ﻃﺮﻳﻘﺔ ﺍﻹﻧﺸﺎء ﻭﺍﻻﺧﺘﺒﺎﺭ ﺭﺳﻤﻴﺎً ﻓﻲ ﺍﻟﺸﻜﻞ ﺃﺩﻧﺎﻩ‪.‬‬

‫ﺻﻔﺤﺔ‪2‬ﻝ‪9‬‬
 ‫ﻗﺴﻢﻋﻠﻮﻡ ﺍﻟﺤﺎﺳﺐ‬ ‫ﺩﻭﺭﺓﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪(CS 302‬‬

‫ﺍﻟﺸﻜﻞ‪:‬ﺇﻧﺸﺎء ﺍﻟﺨﻮﺍﺭﺯﻣﻴﺔ ﻭﺍﺧﺘﺒﺎﺭﻫﺎ‬

‫ﻳﺘﻀﺢﻣﻦ ﺍﻟﺨﻮﺍﺭﺯﻣﻴﺔ ﺍﻟﻤﺬﻛﻮﺭﺓ ﺃﻋﻼﻩ ﺃﻥ ﺍﻟﺨﻮﺍﺭﺯﻣﻴﺔ ﺗﻮﺍﺻﻞ ﺇﻣﻜﺎﻧﻴﺔ ﺍﺳﺘﻜﺸﺎﻑ ﺣﺎﻟﺔ ﺟﺪﻳﺪﺓ ﻓﻲ ﻛﻞ ﺗﻜﺮﺍﺭ‬
‫ﻟﻠﺤﻠﻘﺔﺍﻟﻤﺘﻜﺮﺭﺓ ﺣﺘﻰ ﻭﻻ ﺗﺨﺮﺝ ﺇﻻ ﻋﻨﺪﻣﺎ ﺗﻜﻮﻥ ﺍﻟﺤﺎﻟﺔ ﺍﻟﺤﺎﻟﻴﺔ ﻣﺴﺎﻭﻳﺔ ﻟﻠﻬﺪﻑ‪ .‬ﺍﻟﺠﺰء ﺍﻷﻛﺜﺮ ﺃﻫﻤﻴﺔ ﻓﻲ ﺍﻟﺨﻮﺍﺭﺯﻣﻴﺔ ﻫﻮ‬
‫ﺇﻧﺸﺎءﺣﺎﻟﺔ ﺟﺪﻳﺪﺓ‪ .‬ﻫﺬﻩ ﻟﻴﺴﺖ ﻣﻬﻤﺔ ﺳﻬﻠﺔ‪.‬‬

‫ﺇﺫﺍﻟﻢ ﻳﻜﻦ ﺇﻧﺸﺎء ﺣﺎﻻﺕ ﺟﺪﻳﺪﺓ ﻣﻤﻜﻨﺎً‪ ،‬ﻓﻴﺠﺐ ﺇﻧﻬﺎء ﺍﻟﺨﻮﺍﺭﺯﻣﻴﺔ‪ .‬ﻭﻣﻊ ﺫﻟﻚ‪ ،‬ﻓﻲ ﺧﻮﺍﺭﺯﻣﻴﺘﻨﺎ ﺍﻟﺒﺴﻴﻄﺔ‪ ،‬ﻟﻢ ﻧﻘﻢ‬
‫ﺑﺘﻀﻤﻴﻦﺫﻟﻚ ﻋﻤﺪﺍً ﻟﺘﺒﺴﻴﻂ ﺍﻷﻣﺮ‪ .‬ﻭﻟﻜﻦ ﻛﻴﻒ ﻳﻤﻜﻦ ﻟﻠﻤﺮء ﺃﻥ ﻳﻮﻟﺪ ﺣﺎﻻﺕ ﺍﻟﻤﺸﻜﻠﺔ؟ ﻹﺿﻔﺎء ﺍﻟﻄﺎﺑﻊ ﺍﻟﺮﺳﻤﻲ ﻋﻠﻰ‬
‫ﺫﻟﻚ‪،‬ﻧﺤﺪﺩ ﺃﺭﺑﻌﺔ ﺻﻔﻮﻑ‪ ،‬ﺗﺴﻤﻰ ﻣﺴﺎﺣﺔ ﺍﻟﺤﺎﻟﺔ‪ ،‬ﻳﺸُﺎﺭ ﺇﻟﻴﻬﺎ ﺑـ‬

‫}ﺍﻟﻌﻘﺪ‪ ،‬ﺍﻟﻘﻮﺱ‪ ،‬ﺍﻟﻬﺪﻑ‪ ،‬ﺍﻟﺤﺎﻟﻲ{‪،‬‬

‫ﺃﻳﻦ‪:‬‬
‫ﺍﻟﻌﻘﺪﺗﻤﺜﻞ ﻣﺠﻤﻮﻋﺔ ﺍﻟﺤﺎﻻﺕ ﺍﻟﻤﻮﺟﻮﺩﺓ ﻓﻲ ﻣﺴﺎﺣﺔ ﺍﻟﺒﺤﺚ؛ ﺍﻥﻗﻮﺱﻳﺸﻴﺮ ﺇﻟﻰ ﻋﺎﻣﻞ ﻣﻄﺒﻖ ﻋﻠﻰ ﺣﺎﻟﺔ‬
‫ﻣﻮﺟﻮﺩﺓﻟﻠﺘﺴﺒﺐ ﻓﻲ ﺍﻻﻧﺘﻘﺎﻝ ﺇﻟﻰ ﺣﺎﻟﺔ ﺃﺧﺮﻯ؛ﻫﺪﻑﻳﺸﻴﺮ ﺇﻟﻰ ﺍﻟﺤﺎﻟﺔ ﺍﻟﻤﻄﻠﻮﺑﺔ ﺍﻟﺘﻲ ﺳﻴﺘﻢ ﺗﺤﺪﻳﺪﻫﺎ ﻓﻲ ﺍﻟﻌﻘﺪ؛ ﻭﺣﺎﺿﺮِ‬
‫ﻳﻤﺜﻞﺍﻟﺤﺎﻟﺔ ﺍﻟﺘﻲ ﺗﻢ ﺇﻧﺸﺎﺅﻫﺎ ﺍﻵﻥ ﻟﻠﻤﻄﺎﺑﻘﺔ ﻣﻊ ﺍﻟﻬﺪﻑ‪ .‬ﻣﺴﺎﺣﺔ ﺍﻟﺤﺎﻟﺔ ﻟﻤﻌﻈﻢ ﻣﺸﺎﻛﻞ ﺍﻟﺒﺤﺚ ﺗﺄﺧﺬ ﺷﻜﻞ ﺷﺠﺮﺓ ﺃﻭ‬
‫ﺭﺳﻢﺑﻴﺎﻧﻲ‪ .‬ﻗﺪ ﻳﺤﺘﻮﻱ ﺍﻟﺮﺳﻢ ﺍﻟﺒﻴﺎﻧﻲ ﻋﻠﻰ ﺃﻛﺜﺮ ﻣﻦ ﻣﺴﺎﺭ ﻭﺍﺣﺪ ﺑﻴﻦ ﻋﻘﺪﺗﻴﻦ ﻣﺨﺘﻠﻔﺘﻴﻦ‪ ،‬ﺑﻴﻨﻤﺎ ﺑﺎﻟﻨﺴﺒﺔ ﻟﻠﺸﺠﺮﺓ ﻓﺈﻥ‬
‫ﺍﻟﺤﺪﺍﻷﻗﺼﻰ ﻟﻘﻴﻤﺔ ﻭﺍﺣﺪ ﻫﻮ ﻭﺍﺣﺪ‪.‬‬

‫ﻟﺒﻨﺎءﻧﻈﺎﻡ ﻟﺤﻞ ﻣﺸﻜﻠﺔ ﻣﻌﻴﻨﺔ‪ ،‬ﻧﺤﺘﺎﺝ ﺇﻟﻰ ﺍﻟﻘﻴﺎﻡ ﺑﺄﺭﺑﻌﺔ ﺃﺷﻴﺎء‪:‬‬

‫‪.1‬ﺗﺤﺪﻳﺪ ﺍﻟﻤﺸﻜﻠﺔ ﺑﺪﻗﺔ‪ .‬ﻳﺠﺐ ﺃﻥ ﻳﺘﻀﻤﻦ ﻫﺬﺍ ﺍﻟﺘﻌﺮﻳﻒ ﻣﻮﺍﺻﻔﺎﺕ ﺩﻗﻴﻘﺔ ﻟﻤﺎ ﺳﻴﻜﻮﻥ ﻋﻠﻴﻪ ﺍﻟﻮﺿﻊ )ﺍﻟﻤﻮﺍﻗﻒ( ﺍﻷﻭﻟﻴﺔ‬
‫ﻭﻛﺬﻟﻚﺍﻟﻤﻮﺍﻗﻒ ﺍﻟﻨﻬﺎﺉﻴﺔ ﺍﻟﺘﻲ ﺗﺸﻜﻞ ﺣﻠﻮﻻ ًﻣﻘﺒﻮﻟﺔ ﻟﻠﻤﺸﻜﻠﺔ‪.‬‬

‫ﺻﻔﺤﺔ‪3‬ﻝ‪9‬‬
 ‫ﻗﺴﻢﻋﻠﻮﻡ ﺍﻟﺤﺎﺳﺐ‬ ‫ﺩﻭﺭﺓﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪(CS 302‬‬

‫‪.2‬ﺗﺤﻠﻴﻞ ﺍﻟﻤﺸﻜﻠﺔ‪ .‬ﻳﻤﻜﻦ ﻟﺒﻌﺾ ﺍﻟﻤﻴﺰﺍﺕ ﺍﻟﻤﻬﻤﺔ ﺟﺪﺍً ﺃﻥ ﻳﻜﻮﻥ ﻟﻬﺎ ﺗﺄﺛﻴﺮ ﻫﺎﺉﻞ ﻋﻠﻰ ﻣﺪﻯ ﻣﻼءﻣﺔ ﺍﻟﺘﻘﻨﻴﺎﺕ ﺍﻟﻤﺨﺘﻠﻔﺔ‬
‫ﺍﻟﻤﻤﻜﻨﺔﻟﺤﻞ ﺍﻟﻤﺸﻜﻠﺔ‪.‬‬
‫‪.3‬ﻋﺰﻝ ﻭﺗﻤﺜﻴﻞ ﺍﻟﻤﻌﺮﻓﺔ ﺍﻟﻤﻬﻤﺔ ﺍﻟﻀﺮﻭﺭﻳﺔ ﻟﺤﻞ ﺍﻟﻤﺸﻜﻠﺔ‪.‬‬
‫‪.4‬ﺍﺧﺘﺮ ﺃﻓﻀﻞ ﺗﻘﻨﻴﺎﺕ ﺣﻞ ﺍﻟﻤﺸﻜﻼﺕ ﻭﻗﻢ ﺑﺘﻄﺒﻴﻘﻬﺎ ﻋﻠﻰ ﻣﺸﻜﻠﺔ ﻣﻌﻴﻨﺔ‪.‬‬

‫ﻳﻌﺪﻗﻴﺎﺱ ﺃﺩﺍء ﺣﻞ ﺍﻟﻤﺸﻜﻼﺕ ﺃﻣﺮﺍً ﺃﺳﺎﺳﻴﺎً ﻓﻲ ﺃﻱ ﻧﻬﺞ ﻟﺤﻞ ﺍﻟﻤﺸﻜﻼﺕ‪ .‬ﺇﻥ ﻣﺨﺮﺟﺎﺕ ﺧﻮﺍﺭﺯﻣﻴﺔ ﺣﻞ‬
‫ﺍﻟﻤﺸﻜﻼﺕﻫﻲ ﺇﻣﺎ ﺍﻟﻔﺸﻞ ﺃﻭ ﺍﻟﺤﻞ‪) .‬ﻗﺪ ﺗﺘﻌﻄﻞ ﺑﻌﺾ ﺍﻟﺨﻮﺍﺭﺯﻣﻴﺎﺕ ﻓﻲ ﺣﻠﻘﺔ ﻻ ﻧﻬﺎﺉﻴﺔ ﻭﻻ ﺗﺮُﺟﻊ ﺃﻱ ﻣﺨﺮﺟﺎﺕ ﺃﺑﺪﺍً‪(.‬‬
‫ﺳﻨﻘﻮﻡﺑﺘﻘﻴﻴﻢ ﺃﺩﺍء ﺍﻟﺨﻮﺍﺭﺯﻣﻴﺔ ﺑﺄﺭﺑﻊ ﻃﺮﻕ‪:‬‬

‫ﺍﻻﻛﺘﻤﺎﻝ‪:‬ﻫﻞ ﺍﻟﺨﻮﺍﺭﺯﻣﻴﺔ ﻣﻀﻤﻮﻧﺔ ﻹﻳﺠﺎﺩ ﺣﻞ ﻋﻨﺪﻣﺎ ﻳﻜﻮﻥ ﻫﻨﺎﻙ ﺣﻞ؟ ﺍﻷﻣﺜﻠﻴﺔ‪:‬ﻫﻞ ﺗﺠﺪ‬ ‫‪-‬‬
‫ﺍﻹﺳﺘﺮﺍﺗﻴﺠﻴﺔﺍﻟﺤﻞ ﺍﻷﻣﺜﻞ؟‬ ‫‪-‬‬
‫ﺗﻌﻘﻴﺪﺍﻟﻮﻗﺖ‪:‬ﻛﻢ ﻣﻦ ﺍﻟﻮﻗﺖ ﻳﺴﺘﻐﺮﻕ ﺇﻳﺠﺎﺩ ﺍﻟﺤﻞ؟‬ ‫‪-‬‬
‫ﺗﻌﻘﻴﺪﺍﻟﻔﻀﺎء‪:‬ﻣﺎ ﻣﻘﺪﺍﺭ ﺍﻟﺬﺍﻛﺮﺓ ﺍﻟﻼﺯﻣﺔ ﻹﺟﺮﺍء ﺍﻟﺒﺤﺚ؟‬ ‫‪-‬‬

‫ﺗﻘﻨﻴﺔﺍﻟﺒﺤﺚ‬
‫ﺑﻌﺪﺃﻥ ﻗﻤﻨﺎ ﺑﺼﻴﺎﻏﺔ ﺑﻌﺾ ﺍﻟﻤﺸﺎﻛﻞ‪ ،‬ﻧﺤﺘﺎﺝ ﺍﻵﻥ ﺇﻟﻰ ﺣﻠﻬﺎ‪ .‬ﻭﻳﺘﻢ ﺫﻟﻚ ﻋﻦ ﻃﺮﻳﻖ ﺍﻟﺒﺤﺚ ﻓﻲ ﻣﺴﺎﺣﺔ ﺍﻟﺪﻭﻟﺔ‪.‬‬
‫ﺟﺬﺭﺷﺠﺮﺓ ﺍﻟﺒﺤﺚ ﻫﻮ ﻋﻘﺪﺓ ﺑﺤﺚ ﺗﺘﻮﺍﻓﻖ ﻣﻊ ﺍﻟﺤﺎﻟﺔ ﺍﻷﻭﻟﻴﺔ‪ .‬ﺍﻟﺨﻄﻮﺓ ﺍﻷﻭﻟﻰ ﻫﻲ ﺍﺧﺘﺒﺎﺭ ﻣﺎ ﺇﺫﺍ ﻛﺎﻧﺖ ﻫﺬﻩ ﺣﺎﻟﺔ ﺍﻟﻬﺪﻑ‪.‬‬
‫ﻭﻷﻥﻫﺬﻩ ﻟﻴﺴﺖ ﺣﺎﻟﺔ ﻫﺪﻑ‪ ،‬ﻓﺈﻧﻨﺎ ﺑﺤﺎﺟﺔ ﺇﻟﻰ ﺍﻟﻨﻈﺮ ﻓﻲ ﺑﻌﺾ ﺍﻟﺤﺎﻻﺕ ﺍﻷﺧﺮﻯ‪ .‬ﻭﻳﺘﻢ ﺫﻟﻚ ﻋﻦ ﻃﺮﻳﻖ ﺗﻮﺳﻴﻊ ﺍﻟﻮﺿﻊ‬
‫ﺍﻟﺤﺎﻟﻲ؛ﺃﻱ ﺗﻄﺒﻴﻖ ﺍﻟﺪﺍﻟﺔ ﺍﻟﻼﺣﻘﺔ ﻋﻠﻰ ﺍﻟﺤﺎﻟﺔ ﺍﻟﺤﺎﻟﻴﺔ‪ ،‬ﻭﺑﺎﻟﺘﺎﻟﻲ ﺗﻮﻟﻴﺪ ﻣﺠﻤﻮﻋﺔ ﺟﺪﻳﺪﺓ ﻣﻦ ﺍﻟﺤﺎﻻﺕ‪ .‬ﻭﺍﻵﻥ ﻳﺠﺐ ﻋﻠﻴﻨﺎ‬
‫ﺃﻥﻧﺨﺘﺎﺭ ﺃﻳﺎً ﻣﻦ ﻫﺬﻩ ﺍﻻﺣﺘﻤﺎﻻﺕ ﻳﺠﺐ ﺃﻥ ﻧﻔﻜﺮ ﻓﻴﻪ ﺃﻛﺜﺮ‪ .‬ﻧﺴﺘﻤﺮ ﻓﻲ ﺍﻻﺧﺘﻴﺎﺭ ﻭﺍﻻﺧﺘﺒﺎﺭ ﻭﺍﻟﺘﻮﺳﻴﻊ ﺇﻣﺎ ﺃﻥ ﻳﺘﻢ ﺍﻟﻌﺜﻮﺭ ﻋﻠﻰ‬
‫ﺣﻞﺃﻭ ﻻ ﺗﻮﺟﺪ ﺣﺎﻻﺕ ﺃﺧﺮﻯ ﻟﻴﺘﻢ ﺗﻮﺳﻴﻌﻬﺎ‪ .‬ﻳﺘﻢ ﺗﺤﺪﻳﺪ ﺍﺧﺘﻴﺎﺭ ﺍﻟﺤﺎﻟﺔ ﺍﻟﻤﺮﺍﺩ ﺗﻮﺳﻴﻌﻬﺎ ﻣﻦ ﺧﻼﻝ ﺍﺳﺘﺮﺍﺗﻴﺠﻴﺔ ﺍﻟﺒﺤﺚ‪ .‬ﻣﻦ‬
‫ﺍﻟﻤﻬﻢﺍﻟﺘﻤﻴﻴﺰ ﺑﻴﻦ ﻣﺴﺎﺣﺔ ﺍﻟﺤﺎﻟﺔ ﻭﺷﺠﺮﺓ ﺍﻟﺒﺤﺚ‪ .‬ﺑﺎﻟﻨﺴﺒﺔ ﻟﻤﺸﻜﻠﺔ ﺍﻟﻌﺜﻮﺭ ﻋﻠﻰ ﺍﻟﻄﺮﻳﻖ‪ ،‬ﻫﻨﺎﻙ ﻓﻘﻂﻥﻭﻻﻳﺎﺕ ﻓﻲ‬
‫ﻣﺴﺎﺣﺔﺍﻟﻮﻻﻳﺔ‪ ،‬ﻭﺍﺣﺪﺓ ﻟﻜﻞ ﻣﺪﻳﻨﺔ‪ .‬ﻭﻟﻜﻦ ﻫﻨﺎﻙ ﻋﺪﺩ ﻻ ﺣﺼﺮ ﻟﻪ ﻣﻦ ﺍﻟﻌﻘﺪ‪ .‬ﻫﻨﺎﻙ ﺍﻟﻌﺪﻳﺪ ﻣﻦ ﺍﻟﻄﺮﻕ ﻟﺘﻤﺜﻴﻞ ﺍﻟﻌﻘﺪ‪،‬‬
‫ﻟﻜﻨﻨﺎﺳﻨﻔﺘﺮﺽ ﺃﻥ ﺍﻟﻌﻘﺪﺓ ﻋﺒﺎﺭﺓ ﻋﻦ ﺑﻨﻴﺔ ﺑﻴﺎﻧﺎﺕ ﻣﻜﻮﻧﺔ ﻣﻦ ﺧﻤﺴﺔ ﻣﻜﻮﻧﺎﺕ‪:‬‬

‫• ﻭﻻﻳﺔ‪:‬ﺍﻟﺤﺎﻟﺔ ﻓﻲ ﻣﺴﺎﺣﺔ ﺍﻟﺤﺎﻟﺔ ﺍﻟﺘﻲ ﺗﺘﻮﺍﻓﻖ ﻣﻌﻬﺎ ﺍﻟﻌﻘﺪﺓ‪.‬‬

‫• ﻋﻘﺪﺓﺍﻷﻡ‪:‬ﺍﻟﻌﻘﺪﺓ ﺍﻟﻤﻮﺟﻮﺩﺓ ﻓﻲ ﺷﺠﺮﺓ ﺍﻟﺒﺤﺚ ﺍﻟﺘﻲ ﺃﻧﺸﺄﺕ ﻫﺬﻩ ﺍﻟﻌﻘﺪﺓ‪.‬‬
‫• ﻓﻌﻞ‪ :‬ﺍﻹﺟﺮﺍء ﺍﻟﺬﻱ ﺗﻢ ﺗﻄﺒﻴﻘﻪ ﻋﻠﻰ ﺍﻷﺻﻞ ﻹﻧﺸﺎء ﺍﻟﻌﻘﺪﺓ‪.‬‬
‫• ﺗﻜﻠﻔﺔﺍﻟﻤﺴﺎﺭ‪ :‬ﺍﻟﺘﻜﻠﻔﺔ‪ ،‬ﺍﻟﺘﻲ ﻳﺸُﺎﺭ ﺇﻟﻴﻬﺎ ﺗﻘﻠﻴﺪﻳﺎً ﺑـ (‪ ،g)n‬ﻟﻠﻤﺴﺎﺭ ﻣﻦ ﺍﻟﺤﺎﻟﺔ ﺍﻷﻭﻟﻴﺔ ﺇﻟﻰ ﺍﻟﻌﻘﺪﺓ‪ ،‬ﻛﻤﺎ ﻫﻮ ﻣﻮﺿﺢ‬
‫ﺑﻮﺍﺳﻄﺔﺍﻟﻤﺆﺷﺮﺍﺕ ﺍﻷﺻﻠﻴﺔ‪.‬‬

‫ﺻﻔﺤﺔ‪4‬ﻝ‪9‬‬
 ‫ﻗﺴﻢﻋﻠﻮﻡ ﺍﻟﺤﺎﺳﺐ‬ ‫ﺩﻭﺭﺓﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪(CS 302‬‬

‫• ﺍﻟﻌﻤﻖ‪:‬ﻋﺪﺩ ﺍﻟﺨﻄﻮﺍﺕ ﻋﻠﻰ ﻃﻮﻝ ﺍﻟﻤﺴﺎﺭ ﻣﻦ ﺍﻟﺤﺎﻟﺔ ﺍﻷﻭﻟﻴﺔ‪.‬‬

‫ﻛﺎﻟﻌﺎﺩﺓ‪،‬ﻧﻔﺮﻕ ﺑﻴﻦ ﻋﺎﺉﻠﺘﻴﻦ ﺭﺉﻴﺴﻴﺘﻴﻦ ﻻﺳﺘﺮﺍﺗﻴﺠﻴﺎﺕ ﺍﻟﺒﺤﺚ‪ :‬ﺍﻟﺒﺤﺚ ﺍﻟﻤﻨﻬﺠﻲ ﻭﺍﻟﺒﺤﺚ ﺍﻟﻤﺤﻠﻲ‪ .‬ﻳﻘﻮﻡ‬
‫ﺍﻟﺒﺤﺚﺍﻟﻤﻨﻬﺠﻲ ﺑﺰﻳﺎﺭﺓ ﻛﻞ ﺣﺎﻟﺔ ﻳﻤﻜﻦ ﺃﻥ ﺗﻜﻮﻥ ﺣﻼ‪ ً،‬ﺃﻭ ﻳﺘﺨﻄﻰ ﻓﻘﻂ ﺍﻟﺤﺎﻻﺕ ﺍﻟﺘﻲ ﻳﻈﻬﺮ ﺃﻥ ﺍﻵﺧﺮﻳﻦ ﻳﺴﻴﻄﺮﻭﻥ ﻋﻠﻴﻬﺎ‪،‬‬
‫ﻟﺬﻟﻚﻓﻬﻮ ﺩﺍﺉﻤﺎً ﻗﺎﺩﺭ ﻋﻠﻰ ﺇﻳﺠﺎﺩ ﺍﻟﺤﻞ ﺍﻷﻣﺜﻞ‪ .‬ﺍﻟﺒﺤﺚ ﺍﻟﻤﺤﻠﻲ ﻻ ﻳﻀﻤﻦ ﻫﺬﺍ ﺍﻟﺴﻠﻮﻙ‪ .‬ﻋﻨﺪﻣﺎ ﻳﻨﺘﻬﻲ‪ ،‬ﺑﻌﺪ ﺍﺳﺘﻨﻔﺎﺩ‬
‫ﺍﻟﻤﻮﺍﺭﺩ)ﻣﺜﻞ ﺍﻟﻮﻗﺖ ﺍﻟﻤﺘﺎﺡ ﺃﻭ ﻋﺪﺩ ﻣﺤﺪﻭﺩ ﻣﻦ ﺍﻟﺘﻜﺮﺍﺭﺍﺕ(‪ ،‬ﻓﺈﻧﻪ ﻳﺒُﻠﻎ ﻋﻦ ﺃﻓﻀﻞ ﺣﻞ ﺗﻢ ﺍﻟﻌﺜﻮﺭ ﻋﻠﻴﻪ ﺣﺘﻰ ﺍﻵﻥ‪ ،‬ﻭﻟﻜﻦ‬
‫ﻟﻴﺲﻫﻨﺎﻙ ﻣﺎ ﻳﻀﻤﻦ ﺃﻧﻪ ﺍﻟﺤﻞ ﺍﻷﻣﺜﻞ‪ .‬ﻹﺛﺒﺎﺕ ﺍﻷﻣﺜﻠﻴﺔ‪ ،‬ﻫﻨﺎﻙ ﺣﺎﺟﺔ ﺇﻟﻰ ﺧﻮﺍﺭﺯﻣﻴﺎﺕ ﻣﻨﻬﺠﻴﺔ‪ ،‬ﺑﺘﻜﻠﻔﺔ ﺇﺿﺎﻓﻴﺔ ﺗﺘﻤﺜﻞ‬
‫ﻓﻲﺃﻭﻗﺎﺕ ﺗﺸﻐﻴﻞ ﺃﻃﻮﻝ ﻓﻴﻤﺎ ﻳﺘﻌﻠﻖ ﺑﺎﻟﺒﺤﺚ ﺍﻟﻤﺤﻠﻲ‪ .‬ﻏﺎﻟﺒﺎً ﻣﺎ ﺗﺘﻔﺎﻗﻢ ﺧﻮﺍﺭﺯﻣﻴﺎﺕ ﺍﻟﺒﺤﺚ ﺍﻟﻤﻨﻬﺠﻲ ﻣﻊ ﺣﺠﻢ‬
‫ﺍﻟﻤﺸﻜﻠﺔﻣﻘﺎﺭﻧﺔ ﺑﺨﻮﺍﺭﺯﻣﻴﺎﺕ ﺍﻟﺒﺤﺚ ﺍﻟﻤﺤﻠﻴﺔ‪.‬‬

‫ﺃﻧﻮﺍﻉﺗﻘﻨﻴﺎﺕ ﺍﻟﺒﺤﺚ‬
‫ﻋﺎﺩﺓ ًﻣﺎ ﻳﺘﻢ ﺗﺼﻨﻴﻒ ﺃﻧﻮﺍﻉ ﺍﻟﺒﺤﺚ ﺍﻟﺬﻛﻲ ﺇﻟﻰ ﻓﺉﺘﻴﻦ؛ﺍﻟﺒﺤﺚ ﺍﻷﻋﻤﻰ ﻭﺍﻹﺭﺷﺎﺩﻱ‪ .‬ﺍﻟﺒﺤﺚ ﺍﻷﻋﻤﻰ ﻫﻮ ﺃﺳﻠﻮﺏ‬
‫ﻟﻠﻌﺜﻮﺭﻋﻠﻰ ﺍﻟﻬﺪﻑ ﺩﻭﻥ ﺃﻱ ﻣﻌﻠﻮﻣﺎﺕ ﺇﺿﺎﻓﻴﺔ ﺗﺴﺎﻋﺪ ﻋﻠﻰ ﺍﺳﺘﻨﺘﺎﺝ ﺍﻟﻬﺪﻑ‪ ،‬ﻭﺑﻬﺬﺍ ﺍﻟﻨﻮﻉ ﻻ ﻳﻮﺟﺪ ﺃﻱ ﺍﻋﺘﺒﺎﺭ ﻟﻮﻗﺖ‬
‫ﺍﻟﻌﻤﻠﻴﺔﺃﻭ ﺳﻌﺔ ﺍﻟﺬﺍﻛﺮﺓ‪.‬‬

‫ﻓﻲﺍﻟﺠﺎﻧﺐ ﺍﻵﺧﺮ‪ ،‬ﻳﺤﺘﻮﻱ ﺍﻟﺒﺤﺚ ﺍﻹﺭﺷﺎﺩﻱ ﺩﺍﺉﻤﺎً ﻋﻠﻰ ﻭﻇﻴﻔﺔ ﺗﻘﻴﻴﻢ ﺗﺴﻤﻰ ﺍﻟﻮﻇﻴﻔﺔ ﺍﻹﺭﺷﺎﺩﻳﺔ ﺍﻟﺘﻲ ﺗﻮﺟﻪ‬
‫ﻭﺗﺘﺤﻜﻢﻓﻲ ﺳﻠﻮﻙ ﺧﻮﺍﺭﺯﻣﻴﺔ ﺍﻟﺒﺤﺚ ﻟﻠﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ ﺑﺄﻗﻞ ﺗﻜﻠﻔﺔ ﻭﻭﻗﺖ ﻭﻣﺴﺎﺣﺔ ﻟﻠﺬﺍﻛﺮﺓ‪ .‬ﺗﺤﺘﻮﻱ ﺍﻷﻗﺴﺎﻡ ﺍﻟﺘﺎﻟﻴﺔ‬
‫ﻋﻠﻰﺗﻔﺎﺻﻴﻞ ﻛﻞ ﻧﻮﻉ ﻣﻦ ﺃﻧﻮﺍﻉ ﺍﻟﺒﺤﺚ ﻣﻊ ﺃﻣﺜﻠﺔ ﺑﺴﻴﻄﺔ‪.‬‬

‫ﺃ‪.‬ﺑﺤﺚ ﺃﻋﻤﻰ‬
‫ﻫﻨﺎﻙﺍﻟﻌﺪﻳﺪ ﻣﻦ ﺇﺳﺘﺮﺍﺗﻴﺠﻴﺎﺕ ﺍﻟﺒﺤﺚ ﺍﻟﺘﻲ ﺗﻨﺪﺭﺝ ﺗﺤﺖ ﻋﻨﻮﺍﻥ ﺍﻟﺒﺤﺚ ﺍﻷﻋﻤﻰ )ﻭﻳﺴﻤﻰ ﺃﻳﻀﺎً ﺍﻟﺒﺤﺚ ﺍﻟﻤﻮﺣﺪ(‪.‬‬
‫ﻭﻳﻌﻨﻲﺍﻟﻤﺼﻄﻠﺢ ﺃﻧﻪ ﻟﻴﺲ ﻟﺪﻳﻬﻢ ﻣﻌﻠﻮﻣﺎﺕ ﺇﺿﺎﻓﻴﺔ ﺣﻮﻝ ﺍﻟﺤﺎﻻﺕ ﺑﺨﻼﻑ ﺗﻠﻚ ﺍﻟﻤﻨﺼﻮﺹ ﻋﻠﻴﻬﺎ ﻓﻲ ﺗﻌﺮﻳﻒ ﺍﻟﻤﺸﻜﻠﺔ‪.‬‬
‫ﻛﻞﻣﺎ ﻳﻤﻜﻨﻬﻢ ﻓﻌﻠﻪ ﻫﻮ ﺇﻧﺸﺎء ﺧﻠﻔﺎء ﻭﺗﻤﻴﻴﺰ ﺣﺎﻟﺔ ﺍﻟﻬﺪﻑ ﻋﻦ ﺣﺎﻟﺔ ﻏﻴﺮ ﺍﻟﻬﺪﻑ‪ .‬ﻭﺑﺎﻟﺘﺎﻟﻲ ﻓﺈﻥ ﺍﺳﺘﺮﺍﺗﻴﺠﻴﺎﺕ ﺍﻟﺒﺤﺚ‬
‫ﺍﻷﻋﻤﻰﻟﻴﺲ ﻟﺪﻳﻬﺎ ﺃﻱ ﻣﻌﻠﻮﻣﺎﺕ ﺳﺎﺑﻘﺔ ﻋﻦ ﺍﻟﻬﺪﻑ ﻭﻻ ﺍﻟﻄﺮﻕ ﺍﻟﺒﺴﻴﻄﺔ ﺗﺆﺩﻱ ﺇﻟﻴﻪ‪ .‬ﻭﻣﻊ ﺫﻟﻚ‪ ،‬ﻓﺈﻥ ﺍﻟﺒﺤﺚ ﺍﻷﻋﻤﻰ‬
‫ﻟﻴﺲﺳﻴﺉﺎً‪ ،‬ﻧﻈﺮﺍً ﻷﻥ ﺍﻟﻤﺰﻳﺪ ﻣﻦ ﺍﻟﻤﺸﻜﻼﺕ ﺃﻭ ﺍﻟﺘﻄﺒﻴﻘﺎﺕ ﺗﺤﺘﺎﺝ ﺇﻟﻰ ﺣﻞ؛ ﺑﻤﻌﻨﻰ ﺁﺧﺮ ﻫﻨﺎﻙ ﺑﻌﺾ ﺍﻟﻤﺸﻜﻼﺕ ﺗﻌﻄﻲ‬
‫ﺣﻠﻮﻻ ًﺟﻴﺪﺓ ﺇﺫﺍ ﺗﻢ ﺣﻠﻬﺎ ﺑﺎﺳﺘﺨﺪﺍﻡ ﺍﻟﺒﺤﺚ ﺍﻷﻭﻝ ﺑﺎﻟﻌﻤﻖ ﺃﻭ ﺍﻟﻌﺮﺽ‪ .‬ﻟﺬﻟﻚ‪ ،‬ﻫﻨﺎﻙ ﻧﻮﻋﺎﻥ‪:‬‬

‫ﺻﻔﺤﺔ‪5‬ﻝ‪9‬‬
 ‫ﻗﺴﻢﻋﻠﻮﻡ ﺍﻟﺤﺎﺳﺐ‬ ‫ﺩﻭﺭﺓﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪(CS 302‬‬

‫‪.1‬ﻋﻤﻖ ﺍﻟﺒﺤﺚ ﺍﻷﻭﻝ‬

‫ﻓﻬﻮﻳﻘﻮﻡ ﺩﺍﺉﻤﺎً ﺑﺘﻮﺳﻴﻊ ﺍﻟﻌﻘﺪﺓ ﺍﻷﻋﻤﻖ ﻓﻲ ﺍﻟﻬﺎﻣﺶ ﺍﻟﺤﺎﻟﻲ ﻟﺸﺠﺮﺓ ﺍﻟﺒﺤﺚ‪ .‬ﻳﺴﺘﻤﺮ ﺍﻟﺒﺤﺚ ﻓﻮﺭﺍً ﺇﻟﻰ ﺍﻟﻤﺴﺘﻮﻯ‬
‫ﺍﻷﻋﻤﻖﻟﺸﺠﺮﺓ ﺍﻟﺒﺤﺚ‪ ،‬ﺣﻴﺚ ﻻ ﻳﻜﻮﻥ ﻟﻠﻌﻘﺪ ﺃﻱ ﺧﻠﻔﺎء‪ .‬ﻭﻣﻊ ﺗﻮﺳﻴﻊ ﻫﺬﻩ ﺍﻟﻌﻘﺪ‪ ،‬ﻳﺘﻢ ﺇﺳﻘﺎﻃﻬﺎ ﻣﻦ ﺍﻟﻬﺎﻣﺶ‪ ،‬ﻭﻣﻦ ﺛﻢ‬
‫ﻳﺘﻢ"ﻧﺴﺦ" ﺍﻟﺒﺤﺚ ﺇﻟﻰ ﺍﻟﻌﻘﺪﺓ ﺍﻟﺘﺎﻟﻴﺔ ﺍﻷﻗﻞ ﺳﻄﺤﻴﺔ ﻭﺍﻟﺘﻲ ﻻ ﻳﺰﺍﻝ ﻟﺪﻳﻬﺎ ﺧﻠﻔﺎء ﻏﻴﺮ ﻣﺴﺘﻜﺸﻔﺔ‪.‬‬

‫ﺧﻮﺍﺭﺯﻣﻴﺔﺍﻟﻌﻤﻖ ﺍﻷﻭﻝ ﻫﻲ‪:‬‬

‫‪.1‬ﻗﻢ ﺑﺘﻜﻮﻳﻦ ﻗﺎﺉﻤﺔ ﺍﻧﺘﻈﺎﺭ ﻣﻜﻮﻧﺔ ﻣﻦ ﻋﻨﺼﺮ ﻭﺍﺣﺪ ‪ Q‬ﺗﺘﻜﻮﻥ ﻣﻦ ﺍﻟﻌﻘﺪﺓ ﺍﻟﺠﺬﺭﻳﺔ‪.‬‬

‫‪.2‬ﺣﺘﻰ ﻳﺼﺒﺢ ‪ Q‬ﻓﺎﺭﻏﺎً ﺃﻭ ﻳﺘﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺣﺪﺩ ﻣﺎ ﺇﺫﺍ ﻛﺎﻥ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻓﻲ ‪ Q‬ﻫﻮ ﺍﻟﻬﺪﻑ‪.‬‬

‫ﺃ‪.‬ﺇﺫﺍ ﻛﺎﻥ ﺍﻷﻣﺮ ﻛﺬﻟﻚ‪ ،‬ﻻ ﺗﻔﻌﻞ ﺷﻴﺉﺎ‪.‬‬

‫ﺏ‪.‬ﺇﺫﺍ ﻟﻢ ﻳﻜﻦ ﻛﺬﻟﻚ‪ ،‬ﻗﻢ ﺑﺈﺯﺍﻟﺔ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻣﻦ ‪ Q‬ﻭﺃﺿﻒ ﺍﻟﻌﻨﺎﺻﺮ ﺍﻟﻔﺮﻋﻴﺔ ﻟﻠﻌﻨﺼﺮ ﺍﻷﻭﻝ‪ ،‬ﺇﻥ‬
‫ﻭﺟﺪﺕ‪،‬ﺇﻟﻰ ﻣﻘﺪﻣﺔ ‪.Q‬‬
‫‪.3‬ﺇﺫﺍ ﺗﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺍﻟﻨﺠﺎﺡ؛ ﻓﺸﻞ ﺁﺧﺮ‪.‬‬

‫‪.2‬ﺍﺗﺴﺎﻉ ﺍﻟﺒﺤﺚ ﺍﻷﻭﻝ‬

‫ﺇﻧﻬﺎﺍﺳﺘﺮﺍﺗﻴﺠﻴﺔ ﺑﺴﻴﻄﺔ ﻳﺘﻢ ﻓﻴﻬﺎ ﺗﻮﺳﻴﻊ ﺍﻟﻌﻘﺪﺓ ﺍﻟﺠﺬﺭﻳﺔ ﺃﻭﻻ‪ ً،‬ﺛﻢ ﻳﺘﻢ ﺗﻮﺳﻴﻊ ﻛﺎﻓﺔ ﺍﻟﻌﻘﺪ ﺍﻟﻼﺣﻘﺔ ﻟﻠﻌﻘﺪﺓ ﺍﻟﺠﺬﺭﻳﺔ‬
‫ﺑﻌﺪﺫﻟﻚ‪ ،‬ﺛﻢ ﺍﻟﻼﺣﻘﺔ ﻟﻬﺎ‪ ،‬ﻭﻫﻜﺬﺍ‪ .‬ﺑﺸﻜﻞ ﻋﺎﻡ‪ ،‬ﻳﺘﻢ ﺗﻮﺳﻴﻊ ﺟﻤﻴﻊ ﺍﻟﻌﻘﺪ ﻋﻠﻰ ﻋﻤﻖ ﻣﻌﻴﻦ ﻓﻲ ﺷﺠﺮﺓ ﺍﻟﺒﺤﺚ ﻗﺒﻞ ﺗﻮﺳﻴﻊ‬
‫ﺃﻱﻋﻘﺪ ﻓﻲ ﺍﻟﻤﺴﺘﻮﻯ ﺍﻟﺘﺎﻟﻲ‪.‬‬

‫ﺧﻮﺍﺭﺯﻣﻴﺔﺍﻟﻌﺮﺽ ﺍﻷﻭﻝ ﻫﻲ‪:‬‬

‫‪.1‬ﻗﻢ ﺑﺘﻜﻮﻳﻦ ﻗﺎﺉﻤﺔ ﺍﻧﺘﻈﺎﺭ ﻣﻜﻮﻧﺔ ﻣﻦ ﻋﻨﺼﺮ ﻭﺍﺣﺪ ‪ Q‬ﺗﺘﻜﻮﻥ ﻣﻦ ﺍﻟﻌﻘﺪﺓ ﺍﻟﺠﺬﺭﻳﺔ‪.‬‬

‫‪.2‬ﺣﺘﻰ ﻳﺼﺒﺢ ‪ Q‬ﻓﺎﺭﻏﺎً ﺃﻭ ﻳﺘﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺣﺪﺩ ﻣﺎ ﺇﺫﺍ ﻛﺎﻥ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻓﻲ ‪ Q‬ﻫﻮ ﺍﻟﻬﺪﻑ‪.‬‬

‫ﺃ‪.‬ﺇﺫﺍ ﻛﺎﻥ ﺍﻷﻣﺮ ﻛﺬﻟﻚ‪ ،‬ﻻ ﺗﻔﻌﻞ ﺷﻴﺉﺎ‪.‬‬

‫ﺏ‪.‬ﺇﺫﺍ ﻟﻢ ﻳﻜﻦ ﻛﺬﻟﻚ‪ ،‬ﻗﻢ ﺑﺈﺯﺍﻟﺔ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻣﻦ ‪ Q‬ﻭﺃﺿﻒ ﺍﻟﻌﻨﺎﺻﺮ ﺍﻟﻔﺮﻋﻴﺔ ﻟﻠﻌﻨﺼﺮ ﺍﻷﻭﻝ‪ ،‬ﺇﻥ ﻭﺟﺪﺕ‪ ،‬ﺇﻟﻰ‬
‫ﺍﻟﺠﺰءﺍﻟﺨﻠﻔﻲ ﻣﻦ ‪.Q‬‬
‫‪.3‬ﺇﺫﺍ ﺗﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺍﻟﻨﺠﺎﺡ؛ ﻓﺸﻞ ﺁﺧﺮ‪.‬‬

‫ﺏ‪.‬ﺍﻟﺒﺤﺚ ﺍﺭﺷﺎﺩﻱ‬
‫ﻓﻲﺍﻟﺒﺤﺚ ﺍﻹﺭﺷﺎﺩﻱ‪ ،‬ﻧﺴﺘﺨﺪﻡ ﺑﺸﻜﻞ ﻋﺎﻡ ﻭﺍﺣﺪﺓ ﺃﻭ ﺃﻛﺜﺮ ﻣﻦ ﺍﻟﻮﻇﺎﺉﻒ ﺍﻹﺭﺷﺎﺩﻳﺔ ﻟﺘﺤﺪﻳﺪ ﺍﻟﺪﻭﻝ ﺍﻟﻤﺮﺷﺤﺔ‬
‫ﺍﻷﻓﻀﻞﻣﻦ ﺑﻴﻦ ﻣﺠﻤﻮﻋﺔ ﻣﻦ ﺍﻟﺤﺎﻻﺕ ﺍﻟﻘﺎﻧﻮﻧﻴﺔ ﺍﻟﺘﻲ ﻳﻤﻜﻦ ﺇﻧﺸﺎﺅﻫﺎ ﻣﻦ ﺩﻭﻟﺔ ﻣﻌﺮﻭﻓﺔ‪ .‬ﻭﺑﻌﺒﺎﺭﺓ ﺃﺧﺮﻯ‪ ،‬ﻓﺈﻥ ﺍﻟﻮﻇﻴﻔﺔ‬
‫ﺍﻹﺭﺷﺎﺩﻳﺔﺗﻘﻴﺲ ﻣﺪﻯ ﻣﻼءﻣﺔ ﺍﻟﺪﻭﻝ ﺍﻟﻤﺮﺷﺤﺔ‪ .‬ﺍﻝ‬

‫ﺻﻔﺤﺔ‪6‬ﻝ‪9‬‬
 ‫ﻗﺴﻢﻋﻠﻮﻡ ﺍﻟﺤﺎﺳﺐ‬ ‫ﺩﻭﺭﺓﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪(CS 302‬‬

‫ﻛﻠﻤﺎﻛﺎﻥ ﺍﺧﺘﻴﺎﺭ ﺍﻟﺤﺎﻻﺕ ﺃﻓﻀﻞ‪ ،‬ﻗﻞ ﻋﺪﺩ ﺍﻟﺤﺎﻻﺕ ﺍﻟﻮﺳﻴﻄﺔ ﻟﻠﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ .‬ﻟﻜﻦ؛ ﺃﺻﻌﺐ ﻣﻬﻤﺔ ﻓﻲ ﻣﺸﺎﻛﻞ‬
‫ﺍﻟﺒﺤﺚﺍﻹﺭﺷﺎﺩﻱ ﻫﻲ ﺍﺧﺘﻴﺎﺭ ﺍﻟﻮﻇﺎﺉﻒ ﺍﻹﺭﺷﺎﺩﻳﺔ‪ .‬ﻳﺘﻌﻴﻦ ﻋﻠﻰ ﺍﻟﻤﺮء ﺃﻥ ﻳﺨﺘﺎﺭﻫﺎ ﺑﺸﻜﻞ ﺑﺪﻳﻬﻲ‪ ،‬ﺑﺤﻴﺚ ﻳﻜﻮﻥ ﻣﻦ‬
‫ﺍﻟﻤﺄﻣﻮﻝﻓﻲ ﻣﻌﻈﻢ ﺍﻟﺤﺎﻻﺕ ﺃﻥ ﻳﺘﻤﻜﻦ ﻣﻦ ﺗﻘﻠﻴﻢ ﻣﺴﺎﺣﺔ ﺍﻟﺒﺤﺚ ﺑﺸﻜﻞ ﺻﺤﻴﺢ‪.‬‬

‫ﺗﺴﺘﺨﺪﻡﻃﺮﻕ ﺍﻟﺒﺤﺚ ﺍﻹﺭﺷﺎﺩﻳﺔ ﻭﻇﻴﻔﺔ ﺍﻟﺘﻘﻴﻴﻢ ﻟﺘﻮﺟﻴﻪ ﺍﻟﺒﺤﺚ ﻧﺤﻮ ﺍﻟﻬﺪﻑ‪ .‬ﺳﻴﺘﻢ ﺍﺳﺘﺨﺪﺍﻡ ﺍﻟﻤﻌﻠﻮﻣﺎﺕ‬
‫ﺍﻟﻤﺘﻌﻠﻘﺔﺑﻤﺴﺎﺣﺔ ﺍﻟﻮﻻﻳﺔ ﻟﺘﻮﺟﻴﻪ ﺍﻟﺒﺤﺚ‪ .‬ﻳﺘﻢ ﺍﺳﺘﺨﺪﺍﻡ ﺍﻟﻤﻌﺮﻓﺔ ﻓﻲ ﻭﻇﻴﻔﺔ ﺍﻻﻧﺘﻈﺎﺭ ﻟﺘﺤﺪﻳﺪ ﺍﻟﻌﻘﺪﺓ ﺍﻟﺘﻲ ﺳﻴﺘﻢ‬
‫ﺗﻮﺳﻴﻌﻬﺎﺑﻌﺪ ﺫﻟﻚ‪ .‬ﺗﺴﺘﺨﺪﻡ ﻫﺬﻩ ﺍﻟﻌﻤﻠﻴﺔ ﻭﻇﻴﻔﺔ ﺍﻟﺘﻘﻴﻴﻢ‪:‬‬

‫ﻭﻇﻴﻔﺔﺍﻟﺘﻘﻴﻴﻢ ﻭ)ﻥ(‬
‫ﺍﻟﺘﻜﻠﻔﺔ‪:‬ﺯ)ﻥ(=ﺝ‬
‫ﺍﻟﻜﺸﻒﻋﻦ ﻣﺠﺮﻳﺎﺕ ﺍﻷﻣﻮﺭ‪) h)n(=E :‬ﺗﻘﺪﻳﺮ ﺍﻟﻤﺴﺎﻓﺔ ﺇﻟﻰ ﺍﻟﻬﺪﻑ(‬

‫ﺣﻴﺚ‪ -:g)n( :‬ﻳﻘﻴﺲ ﺍﻟﻄﻮﻝ ﺍﻟﻔﻌﻠﻲ ﻟﻠﻤﺴﺎﺭ ﻣﻦ ﺃﻱ ﺣﺎﻟﺔ )‪ (n‬ﺇﻟﻰ ﺣﺎﻟﺔ ﺍﻟﺒﺪﺍﻳﺔ‪ .‬ﺑﻤﻌﻨﻰ ﺁﺧﺮ‪ ،‬ﻫﻲ ﺍﻟﺘﻜﻠﻔﺔ ﺍﻟﻔﻌﻠﻴﺔ ﻣﻦ‬
‫ﺍﻟﻌﻘﺪﺓﺍﻷﻭﻟﻴﺔ )ﻋﻘﺪﺓ ﺍﻟﺒﺪﺍﻳﺔ( ﺇﻟﻰ ﺍﻟﻌﻘﺪﺓ ‪) n‬ﺃﻱ ﺇﻳﺠﺎﺩ ﺗﻜﻠﻔﺔ ﺍﻟﻤﺴﺎﺭ ﺍﻷﻣﺜﻞ(‬

‫‪،‬ﺇﻟﻰﺍﻟﻬﺪﻑ‪ .‬ﺑﻌﺒﺎﺭﺓ ﺃﺧﺮﻯ (‪ )n‬ﻭﻫﻮ ﺗﻘﺪﻳﺮ ﺇﺭﺷﺎﺩﻱ ﻟﻠﻤﺴﺎﻓﺔ ﻣﻦ ﺍﻟﺤﺎﻟﺔ ‪h)n(:-‬‬

‫ﺇﻧﻬﺎﺍﻟﺘﻜﻠﻔﺔ ﺍﻟﻤﻘﺪﺭﺓ ﻟﻠﻤﺴﺎﺭ ﺍﻷﻣﺜﻞ ﻣﻦ ﺍﻟﻌﻘﺪﺓ ‪ n‬ﺇﻟﻰ ﺍﻟﻌﻘﺪﺓ ﺍﻟﻤﺴﺘﻬﺪﻓﺔ )ﺍﻟﻌﻘﺪﺓ ﺍﻟﻮﺟﻬﺔ(‪.‬‬
‫ﺗﻘﻮﻡﻭﻇﻴﻔﺔ ﺍﻟﺘﻘﻴﻴﻢ ﺑﺈﺭﺟﺎﻉ ﺭﻗﻢ ﻳﺼﻒ ﻣﺪﻯ ﺍﻟﺮﻏﺒﺔ ﻓﻲ ﺗﻮﺳﻴﻊ ﺍﻟﻌﻘﺪﺓ ﻭﺗﺴﺘﺨﺪﻡ ﻫﺬﻩ ﺍﻷﺭﻗﺎﻡ ﻟﺘﻮﺟﻴﻪ ﺍﻟﺒﺤﺚ‬
‫ﻧﺤﻮﺍﻟﻬﺪﻑ‪.‬‬
‫‪.1‬ﺑﺤﺚ ﺗﺴﻠﻖ ﺍﻟﺘﻼﻝ‬
‫ﺍﻟﻔﻜﺮﺓﻫﻨﺎ ﻫﻲ ﺃﻧﻚ ﻻ ﺗﺤﺘﻔﻆ ﺑﻘﺎﺉﻤﺔ ﻛﺒﻴﺮﺓ ﻣﻦ ﺍﻟﻮﻻﻳﺎﺕ ﻣﻦ ﺣﻮﻟﻚ‪ ،‬ﻓﻘﻂ ﻗﻢ ﺑﺘﺘﺒﻊ ﺍﻟﺤﺎﻟﺔ ﺍﻟﻮﺣﻴﺪﺓ ﺍﻟﺘﻲ ﺗﻔﻜﺮ‬
‫ﻓﻴﻬﺎ‪،‬ﻭﺍﻟﻤﺴﺎﺭ ﺍﻟﺬﻱ ﺃﻭﺻﻠﻚ ﺇﻟﻰ ﻫﻨﺎﻙ ﻣﻦ ﺍﻟﺤﺎﻟﺔ ﺍﻷﻭﻟﻴﺔ‪ .‬ﻓﻲ ﻛﻞ ﻭﻻﻳﺔ ﺗﺨﺘﺎﺭﻫﺎ‪ ،‬ﺗﻘﻮﺩﻙ ﺍﻟﻮﻻﻳﺔ ﺇﻟﻰ ﺍﻻﻗﺘﺮﺍﺏ ﻣﻦ‬
‫ﺍﻟﻬﺪﻑﻭﻓﻘﺎً ﻟﺘﻜﻠﻔﺔ ﺍﻟﺘﻘﺪﻳﺮ ﺍﻹﺭﺷﺎﺩﻱ ﻟﻠﺤﺎﻟﺔ (‪ ،g)n‬ﻭﺍﺳﺘﻤﺮ ﻣﻦ ﻫﻨﺎﻙ‪.‬‬

‫ﻳﺄﺗﻲﺍﺳﻢ "‪ "Hill Climbing‬ﻣﻦ ﻓﻜﺮﺓ ﺃﻧﻚ ﺗﺤﺎﻭﻝ ﺍﻟﻌﺜﻮﺭ ﻋﻠﻰ ﻗﻤﺔ ﺍﻟﺘﻞ ﻭﺗﺬﻫﺐ ﻓﻲ ﺍﻻﺗﺠﺎﻩ ﺍﻷﻋﻠﻰ ﺃﻳﻨﻤﺎ ﻛﻨﺖ‪.‬‬

‫ﺻﻔﺤﺔ‪7‬ﻝ‪9‬‬
 ‫ﻗﺴﻢﻋﻠﻮﻡ ﺍﻟﺤﺎﺳﺐ‬ ‫ﺩﻭﺭﺓﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪(CS 302‬‬

‫ﺧﻮﺍﺭﺯﻣﻴﺔﺗﺴﻠﻖ ﺍﻟﺘﻞ ﻫﻲ‪:‬‬

‫‪.1‬ﻗﻢ ﺑﺘﻜﻮﻳﻦ ﻗﺎﺉﻤﺔ ﺍﻧﺘﻈﺎﺭ ﻣﻜﻮﻧﺔ ﻣﻦ ﻋﻨﺼﺮ ﻭﺍﺣﺪ ‪ Q‬ﺗﺘﻜﻮﻥ ﻣﻦ ﺍﻟﻌﻘﺪﺓ ﺍﻟﺠﺬﺭﻳﺔ‪.‬‬

‫‪.2‬ﺣﺘﻰ ﻳﺼﺒﺢ ‪ Q‬ﻓﺎﺭﻏﺎً ﺃﻭ ﻳﺘﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺣﺪﺩ ﻣﺎ ﺇﺫﺍ ﻛﺎﻥ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻓﻲ ‪ Q‬ﻫﻮ ﺍﻟﻬﺪﻑ‪.‬‬

‫ﺃ( ﺇﺫﺍ ﻛﺎﻥ ﺍﻷﻣﺮ ﻛﺬﻟﻚ‪ ،‬ﻓﻼ ﺗﻔﻌﻞ ﺷﻴﺉﺎً‪.‬‬

‫ﺏ( ﺇﺫﺍ ﻟﻢ ﻳﻜﻦ ﺍﻷﻣﺮ ﻛﺬﻟﻚ‪ ،‬ﻗﻢ ﺑﺈﺯﺍﻟﺔ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻣﻦ ‪ ،Q‬ﻭﻗﻢ ﺑﻔﺮﺯ ﺃﺑﻨﺎﺉﻪ‪ ،‬ﺇﻥ ﻭﺟﺪ‪ ،‬ﻭﻓﻘﺎً ﻟﺘﻘﺪﻳﺮ‬
‫ﻗﻴﻤﺔﺍﻟﻤﺴﺎﻓﺔ ﺍﻟﻤﺘﺒﻘﻴﺔ (‪ ،g)n‬ﻭﺃﺿﻒ ﻫﺬﻩ ﺍﻟﻘﺎﺉﻤﺔ ﺍﻟﻤﺼﻨﻔﺔ ﺇﻟﻰ ﺍﻟﺠﺰء ﺍﻷﻣﺎﻣﻲ ﻣﻦ ‪.Q‬‬
‫‪.3‬ﺇﺫﺍ ﺗﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺍﻟﻨﺠﺎﺡ؛ ﻓﺸﻞ ﺁﺧﺮ‪.‬‬

‫‪.2‬ﺍﻟﺒﺤﺚ ﺍﻷﻓﻀﻞ ﺃﻭﻻً‬

‫ﻓﻲﺍﻟﺒﺤﺚ ﺍﻷﻓﻀﻞ ﺃﻭﻻ‪ ً،‬ﻳﺘﻢ ﺍﺳﺘﺉﻨﺎﻑ ﺗﻮﺳﻴﻊ ﺍﻟﻌﻘﺪ ﻣﻦ ﺃﻓﻀﻞ ﻋﻘﺪﺓ ﻣﻔﺘﻮﺣﺔ ﺗﻤﺖ ﺯﻳﺎﺭﺗﻬﺎ ﺣﺘﻰ ﺍﻵﻥ‪ ،‬ﺑﻐﺾ‬
‫ﺍﻟﻨﻈﺮﻋﻦ ﻣﻜﺎﻥ ﻭﺟﻮﺩﻫﺎ ﻓﻲ ﺍﻟﺸﺠﺮﺓ ﺍﻟﻤﺴﺘﻜﺸﻔﺔ ﺟﺰﺉﻴﺎً‪ .‬ﻛﻤﺎ ﺗﻘﻮﻡ ﺃﻳﻀﺎً ﺑﺈﻏﻼﻕ ﺍﻟﻬﺪﻑ ﻭﻓﻘﺎً ﻟﺘﻜﻠﻔﺔ ﺍﻟﺘﻘﺪﻳﺮ ﺍﻹﺭﺷﺎﺩﻱ‬
‫ﻟﻠﺤﺎﻟﺔ (‪.g)n‬‬
‫ﺍﻟﺨﻮﺍﺭﺯﻣﻴﺔﺍﻷﻓﻀﻞ ﺃﻭﻻ ًﻫﻲ‪:‬‬

‫‪.1‬ﻗﻢ ﺑﺘﻜﻮﻳﻦ ﻗﺎﺉﻤﺔ ﺍﻧﺘﻈﺎﺭ ﻣﻜﻮﻧﺔ ﻣﻦ ﻋﻨﺼﺮ ﻭﺍﺣﺪ ‪ Q‬ﺗﺘﻜﻮﻥ ﻣﻦ ﺍﻟﻌﻘﺪﺓ ﺍﻟﺠﺬﺭﻳﺔ‪.‬‬

‫‪.2‬ﺣﺘﻰ ﻳﺼﺒﺢ ‪ Q‬ﻓﺎﺭﻏﺎً ﺃﻭ ﻳﺘﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺣﺪﺩ ﻣﺎ ﺇﺫﺍ ﻛﺎﻥ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻓﻲ ‪ Q‬ﻫﻮ ﺍﻟﻬﺪﻑ‪.‬‬

‫ﺃ( ﺇﺫﺍ ﻛﺎﻥ ﺍﻷﻣﺮ ﻛﺬﻟﻚ‪ ،‬ﻓﻼ ﺗﻔﻌﻞ ﺷﻴﺉﺎً‪.‬‬

‫ﺏ( ﺇﺫﺍ ﻟﻢ ﻳﻜﻦ ﺍﻷﻣﺮ ﻛﺬﻟﻚ‪ ،‬ﻓﻘﻢ ﺑﺈﺯﺍﻟﺔ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻣﻦ ‪ ،Q‬ﻭﺃﺿﻒ ﺃﺑﻨﺎﺉﻪ ﺇﻟﻰ ‪ ،Q‬ﺇﻥ ﻭﺟﺪ‪ ،‬ﻭﻗﻢ‬
‫ﺑﻔﺮﺯﻛﻞ ‪ Q‬ﻭﻓﻘﺎً ﻟﻘﻴﻤﺔ ﺍﻟﻤﺴﺎﻓﺔ ﺍﻟﻤﺘﺒﻘﻴﺔ ﺍﻟﻤﻘﺪﺭﺓ (‪.g)n‬‬
‫‪.3‬ﺇﺫﺍ ﺗﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺍﻟﻨﺠﺎﺡ؛ ﻓﺸﻞ ﺁﺧﺮ‪.‬‬

‫‪.3‬ﻓﺮﻉ ﻭﻣﻨﻀﻢ ﺍﻟﺒﺤﺚ‬

‫ﺗﻌﺘﺒﺮﻫﺬﻩ ﺍﻟﻄﺮﻳﻘﺔ ﺃﻓﻀﻞ ﻣﺴﺎﺭ `` ﺣﺘﻰ ﺍﻵﻥ''‪ .‬ﺑﺪﻻ ًﻣﻦ ﺃﻓﻀﻞ ﺧﻠﻴﻔﺔ‪ .‬ﻭﻳﺘﻮﻗﻒ ﻓﻘﻂ ﻋﻨﺪﻣﺎ ﻳﻜﺘﺸﻒ ﻫﺪﻓﺎً‬
‫ﻭﺍﺣﺪﺍًﻋﻠﻰ ﺍﻷﻗﻞ ﻭﻻ ﺗﻮﺟﺪ ﻣﺴﺎﺭﺍﺕ ﻏﻴﺮ ﻣﺴﺘﻜﺸﻔﺔ ﺫﺍﺕ ﻃﻮﻝ ﺃﻗﺼﺮ ﻣﻦ ﺃﻗﺼﺮ ﻣﺴﺎﺭ ﺟﺬﺭ ﻟﻠﻬﺪﻑ ﺗﻢ ﺍﻟﻌﺜﻮﺭ ﻋﻠﻴﻪ‪ .‬ﻓﻲ‬
‫ﻛﻞﻭﻻﻳﺔ ﺗﺨﺘﺎﺭﻫﺎ‪ ،‬ﺗﻘﻮﺩﻙ ﺍﻟﻮﻻﻳﺔ ﺇﻟﻰ ﺍﻻﻗﺘﺮﺍﺏ ﻣﻦ ﺍﻟﻬﺪﻑ ﻭﻓﻘﺎً ﻟﻠﺘﻘﺪﻳﺮ ﺍﻹﺭﺷﺎﺩﻱ )ﺗﻘﺪﻳﺮ ﺍﻟﻤﺴﺎﻓﺔ ﺇﻟﻰ ﺍﻟﻬﺪﻑ( (‪،h)n‬‬
‫ﻭﺍﺳﺘﻤﺮﻣﻦ ﻫﻨﺎﻙ‪.‬‬

‫ﺧﻮﺍﺭﺯﻣﻴﺔﺍﻟﻔﺮﻉ ﻭﺍﻟﺮﺑﻂ ﻫﻲ‪:‬‬

‫ﺻﻔﺤﺔ‪8‬ﻝ‪9‬‬
 ‫ﻗﺴﻢﻋﻠﻮﻡ ﺍﻟﺤﺎﺳﺐ‬ ‫ﺩﻭﺭﺓﺍﻟﺬﻛﺎء ﺍﻻﺻﻄﻨﺎﻋﻲ )‪(CS 302‬‬

‫‪.1‬ﻗﻢ ﺑﺘﻜﻮﻳﻦ ﻗﺎﺉﻤﺔ ﺍﻧﺘﻈﺎﺭ ﻣﻜﻮﻧﺔ ﻣﻦ ﻋﻨﺼﺮ ﻭﺍﺣﺪ ‪ Q‬ﺗﺘﻜﻮﻥ ﻣﻦ ﺍﻟﻌﻘﺪﺓ ﺍﻟﺠﺬﺭﻳﺔ‪.‬‬

‫‪.2‬ﺣﺘﻰ ﻳﺼﺒﺢ ‪ Q‬ﻓﺎﺭﻏﺎً ﺃﻭ ﻳﺘﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺣﺪﺩ ﻣﺎ ﺇﺫﺍ ﻛﺎﻥ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻓﻲ ‪ Q‬ﻫﻮ ﺍﻟﻬﺪﻑ‪.‬‬

‫ﺃ( ﺇﺫﺍ ﻛﺎﻥ ﺍﻷﻣﺮ ﻛﺬﻟﻚ‪ ،‬ﻓﻼ ﺗﻔﻌﻞ ﺷﻴﺉﺎً‪.‬‬

‫ﺏ( ﺇﺫﺍ ﻟﻢ ﻳﻜﻦ ﺍﻷﻣﺮ ﻛﺬﻟﻚ‪ ،‬ﻗﻢ ﺑﺈﺯﺍﻟﺔ ﺍﻟﻌﻨﺼﺮ ﺍﻷﻭﻝ ﻣﻦ ‪ ،Q‬ﻭﺃﺿﻒ ﺃﺑﻨﺎﺉﻪ ﺇﻟﻰ ‪ ،Q‬ﺇﻥ ﻭﺟﺪ‪ ،‬ﻭﻗﻢ‬
‫ﺑﻔﺮﺯﻛﻞ ‪ Q‬ﻭﻓﻘﺎً ﻟﺘﻘﺪﻳﺮ ﺍﻟﻤﺴﺎﻓﺔ ﺍﻟﻤﺘﺒﻘﻴﺔ ﺇﻟﻰ ﻗﻴﻤﺔ ﺍﻟﻬﺪﻑ (‪.h)n‬‬
‫‪.3‬ﺇﺫﺍ ﺗﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺍﻟﻨﺠﺎﺡ؛ ﻓﺸﻞ ﺁﺧﺮ‪.‬‬

‫‪.4‬ﺑﺤﺚ*‬
‫ﺧﻮﺍﺭﺯﻣﻴﺔﺍﻟﺒﺤﺚ ﺍﻟﻨﺠﻤﻴﺔ ﻫﻲ ﺧﻮﺍﺭﺯﻣﻴﺔ ﺑﺤﺚ ﺭﺳﻮﻣﻴﺔ ﻣﺴﺘﺨﺪﻣﺔ ﻋﻠﻰ ﻧﻄﺎﻕ ﻭﺍﺳﻊ‪ .‬ﻭﻫﻲ ﺃﻳﻀﺎً ﺧﻮﺍﺭﺯﻣﻴﺔ‬
‫ﺇﺭﺷﺎﺩﻳﺔﻋﺎﻟﻴﺔ ﺍﻟﻜﻔﺎءﺓ ﺗﺴﺘﺨﺪﻡ ﻓﻲ ﺍﻟﻌﺜﻮﺭ ﻋﻠﻰ ﻣﺴﺎﺭ ﻣﺘﻐﻴﺮ ﺃﻭ ﻣﻨﺨﻔﺾ ﺍﻟﺘﻜﻠﻔﺔ‪ .‬ﺗﻌﺘﺒﺮ ﻭﺍﺣﺪﺓ ﻣﻦ ﺃﻓﻀﻞ ﺧﻮﺍﺭﺯﻣﻴﺎﺕ‬
‫ﺍﻟﺒﺤﺚﺍﻟﺬﻛﻴﺔ ﺍﻟﺘﻲ ﺗﺠﻤﻊ ﺑﻴﻦ ﻣﺰﺍﻳﺎ ﻛﻞ ﻣﻦ ﺧﻮﺍﺭﺯﻣﻴﺔ ﺍﻷﻓﻀﻞ ﺃﻭﻻ ًﻭﺍﻟﺨﻮﺍﺭﺯﻣﻴﺔ ﺍﻟﻔﺮﻋﻴﺔ ﻭﺍﻟﻤﻨﻀﻤﺔ‪ .‬ﺗﺴﺘﺨﺪﻡ ﺧﻮﺍﺭﺯﻣﻴﺔ‬
‫ﺍﻟﺒﺤﺚﻋﻦ ﻣﺴﺎﺭ ﺍﻟﻨﺠﻤﺔ ﻭﻇﻴﻔﺔ ﺍﻟﺘﻘﻴﻴﻢ )ﻳﺸُﺎﺭ ﺇﻟﻴﻬﺎ ﻋﺎﺩﺓ ًﺑـ (‪ (f )n‬ﻟﺘﻮﺟﻴﻪ ﻭﺗﺤﺪﻳﺪ ﺍﻟﺘﺮﺗﻴﺐ ﺍﻟﺬﻱ ﻳﺰﻭﺭ ﺑﻪ ﺍﻟﺒﺤﺚ ﺍﻟﻌﻘﺪ‬
‫ﻓﻲﺍﻟﺸﺠﺮﺓ‪ .‬ﻳﺘﻢ ﺇﻋﻄﺎء ﻭﻇﻴﻔﺔ ﺍﻟﺘﻘﻴﻴﻢ ﻋﻠﻰ ﺍﻟﻨﺤﻮ ﺍﻟﺘﺎﻟﻲ‪f)n( = g)n( + h)n( :‬‬

‫ﺃﻳﻦ‪:‬ﺯ )ﻥ(ﻫﻲ ﺍﻟﺘﻜﻠﻔﺔ ﺍﻟﻔﻌﻠﻴﺔ ﻣﻦ ﺍﻟﻌﻘﺪﺓ ﺍﻷﻭﻟﻴﺔ )ﻋﻘﺪﺓ ﺍﻟﺒﺪﺍﻳﺔ( ﺇﻟﻰ ﺍﻟﻌﻘﺪﺓ ‪) n‬ﺃﻱ ﺇﻳﺠﺎﺩ ﺗﻜﻠﻔﺔ ﺍﻟﻤﺴﺎﺭ ﺍﻷﻣﺜﻞ(‪h)n( ،‬‬
‫ﻫﻲﺍﻟﺘﻜﻠﻔﺔ ﺍﻟﻤﻘﺪﺭﺓ ﻟﻠﻤﺴﺎﺭ ﺍﻷﻣﺜﻞ ﻣﻦ ﺍﻟﻌﻘﺪﺓ ‪ n‬ﺇﻟﻰ ﺍﻟﻌﻘﺪﺓ ﺍﻟﻤﺴﺘﻬﺪﻓﺔ )ﺍﻟﻌﻘﺪﺓ ﺍﻟﻮﺟﻬﺔ(‪ ،‬ﻭﺍﻟﺘﻲ ﻳﻌﺘﻤﺪ ﻋﻠﻰ‬
‫ﺍﻟﻤﻌﻠﻮﻣﺎﺕﺍﻹﺭﺷﺎﺩﻳﺔ ﻟﻤﻨﻄﻘﺔ ﺍﻟﻤﺸﻜﻠﺔ‪.‬‬
‫ﺧﻮﺍﺭﺯﻣﻴﺔﺍﻟﺒﺤﺚ ‪ *A‬ﻫﻲ‪:‬‬

‫‪.1‬ﻗﻢ ﺑﺘﺸﻜﻴﻞ ﻗﺎﺉﻤﺔ ﺍﻧﺘﻈﺎﺭ ‪ Q‬ﻣﻦ ﺍﻟﻤﺴﺎﺭﺍﺕ ﺍﻟﺠﺰﺉﻴﺔ‪ .‬ﺩﻉ ‪ Q‬ﺍﻷﻭﻟﻲ ﻳﺘﻜﻮﻥ ﻣﻦ ﻣﺴﺎﺭ ﺧﺎﻝ ٍﻣﻦ ﺍﻟﺘﻜﻠﻔﺔ ﻭﺍﻟﺨﻄﻮﺍﺕ‬
‫ﺍﻟﺼﻔﺮﻳﺔﻣﻦ ﺍﻟﺠﺬﺭ ﺇﻟﻰ ﻻ ﻣﻜﺎﻥ‪.‬‬
‫‪.2‬ﺣﺘﻰ ﻳﺼﺒﺢ ‪ Q‬ﻓﺎﺭﻏﺎً ﺃﻭ ﻳﺘﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺣﺪﺩ ﻣﺎ ﺇﺫﺍ ﻛﺎﻥ ﺍﻟﻤﺴﺎﺭ ﺍﻷﻭﻝ ﻓﻲ ‪ Q‬ﻳﺼﻞ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪.‬‬

‫‪2‬ﺃ‪ .‬ﺇﺫﺍ ﺣﺪﺙ ﺫﻟﻚ‪ ،‬ﻻ ﺗﻔﻌﻞ ﺷﻴﺉﺎ‪.‬‬

‫‪2‬ﺏ‪.‬ﺇﺫﺍ ﻟﻢ ﻳﺤﺪﺙ ﺫﻟﻚ‪:‬‬

‫‪2‬ﺏ‪.1‬ﻗﻢ ﺑﺈﺯﺍﻟﺔ ﺍﻟﻤﺴﺎﺭ ﺍﻷﻭﻝ ﻣﻦ ‪.Q‬‬

‫‪2‬ﺏ‪.2‬ﻗﻢ ﺑﺘﻜﻮﻳﻦ ﻣﺴﺎﺭﺍﺕ ﺟﺪﻳﺪﺓ ﻣﻦ ﺗﻠﻚ ﺍﻟﺘﻲ ﺗﻤﺖ ﺇﺯﺍﻟﺘﻬﺎ ﻋﻦ ﻃﺮﻳﻖ ﺗﻤﺪﻳﺪ ﺧﻄﻮﺓ ﻭﺍﺣﺪﺓ‪.‬‬

‫‪2‬ﺏ‪.3‬ﺃﺿﻒ ﺍﻟﻤﺴﺎﺭﺍﺕ ﺍﻟﺠﺪﻳﺪﺓ ﺇﻟﻰ ‪.Q‬‬

‫‪2‬ﺏ‪.4‬ﻗﻢ ﺑﻔﺮﺯ ‪ Q‬ﻭﻓﻘﺎً ﻟﻤﺠﻤﻮﻉ ﺍﻟﺘﻜﻠﻔﺔ ﺍﻟﻔﻌﻠﻴﺔ ﺣﺘﻰ ﺍﻵﻥ ‪ +‬ﺗﻘﺪﻳﺮ ﺍﻟﺤﺪ ﺍﻷﺩﻧﻰ ﻟـ‬
‫ﺍﻟﺘﻜﻠﻔﺔﺍﻟﻤﺘﺒﻘﻴﺔ‪.‬‬
‫‪.3‬ﺇﺫﺍ ﺗﻢ ﺍﻟﻮﺻﻮﻝ ﺇﻟﻰ ﺍﻟﻬﺪﻑ‪ ،‬ﺍﻟﻨﺠﺎﺡ؛ ﻓﺸﻞ ﺁﺧﺮ‪.‬‬

‫ﺻﻔﺤﺔ‪9‬ﻝ‪9‬‬