1.0CS/DS Student Portfolioshttps://portfolios.cs.earlham.eduTien Phanhttps://portfolios.cs.earlham.edu/index.php/author/ttphan21/3 Pitches - Polished version - CS/DS Student Portfoliosrich600338<blockquote class="wp-embedded-content" data-secret="Cpg2p2Bdjh"><a href="https://portfolios.cs.earlham.edu/index.php/2023/10/11/3-pitches-polished-version/">3 Pitches – Polished version</a></blockquote><iframe sandbox="allow-scripts" security="restricted" src="https://portfolios.cs.earlham.edu/index.php/2023/10/11/3-pitches-polished-version/embed/#?secret=Cpg2p2Bdjh" width="600" height="338" title="“3 Pitches – Polished version” — CS/DS Student Portfolios" data-secret="Cpg2p2Bdjh" frameborder="0" marginwidth="0" marginheight="0" scrolling="no" class="wp-embedded-content"></iframe><script type="text/javascript">
/* <![CDATA[ */
/*! This file is auto-generated */
!function(d,l){"use strict";l.querySelector&&d.addEventListener&&"undefined"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!/[^a-zA-Z0-9]/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret="'+t.secret+'"]'),o=l.querySelectorAll('blockquote[data-secret="'+t.secret+'"]'),c=new RegExp("^https?:$","i"),i=0;i<o.length;i++)o[i].style.display="none";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute("style"),"height"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):"link"===t.message&&(r=new URL(s.getAttribute("src")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener("message",d.wp.receiveEmbedMessage,!1),l.addEventListener("DOMContentLoaded",function(){for(var e,t,s=l.querySelectorAll("iframe.wp-embedded-content"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute("data-secret"))||(t=Math.random().toString(36).substring(2,12),e.src+="#?secret="+t,e.setAttribute("data-secret",t)),e.contentWindow.postMessage({message:"ready",secret:t},"*")},!1)))}(window,document);
//# sourceURL=https://portfolios.cs.earlham.edu/wp-includes/js/wp-embed.min.js
/* ]]> */
</script>
Pitch 1: Reduce the encounter of local minima in heuristic search space. In the heuristic search space of heuristic algorithms, there are areas where the nodes appear to be closer to the goal state, but when the algorithm encounters these … Read More